./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9af739900018493f70ca6be86d814e194413d937 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:48:28,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:48:28,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:48:28,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:48:28,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:48:28,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:48:28,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:48:28,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:48:28,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:48:28,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:48:28,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:48:28,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:48:28,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:48:28,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:48:28,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:48:28,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:48:28,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:48:28,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:48:28,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:48:28,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:48:28,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:48:28,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:48:28,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:48:28,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:48:28,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:48:28,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:48:28,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:48:28,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:48:28,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:48:28,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:48:28,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:48:28,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:48:28,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:48:28,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:48:28,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:48:28,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:48:28,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:48:28,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:48:28,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:48:28,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:48:28,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:48:28,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 19:48:28,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:48:28,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:48:28,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:48:28,381 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:48:28,381 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:48:28,381 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:48:28,381 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:48:28,382 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:48:28,382 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:48:28,382 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:48:28,382 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:48:28,382 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:48:28,382 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:48:28,382 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:48:28,382 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:48:28,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:48:28,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:48:28,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:48:28,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:48:28,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:48:28,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:48:28,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:48:28,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:48:28,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:48:28,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:48:28,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:48:28,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:48:28,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:48:28,385 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:48:28,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:48:28,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:48:28,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:48:28,386 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5f66ac8f-a159-454b-8e61-c8551d012744/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9af739900018493f70ca6be86d814e194413d937 [2019-12-07 19:48:28,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:48:28,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:48:28,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:48:28,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:48:28,496 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:48:28,496 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2019-12-07 19:48:28,532 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/data/f35dd0fc9/1157a75d303f43bfb2f469cfd8355368/FLAG39179a315 [2019-12-07 19:48:28,872 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:48:28,873 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2019-12-07 19:48:28,876 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/data/f35dd0fc9/1157a75d303f43bfb2f469cfd8355368/FLAG39179a315 [2019-12-07 19:48:29,282 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/data/f35dd0fc9/1157a75d303f43bfb2f469cfd8355368 [2019-12-07 19:48:29,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:48:29,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:48:29,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:48:29,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:48:29,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:48:29,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bc6c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29, skipping insertion in model container [2019-12-07 19:48:29,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:48:29,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:48:29,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:48:29,409 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:48:29,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:48:29,462 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:48:29,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29 WrapperNode [2019-12-07 19:48:29,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:48:29,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:48:29,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:48:29,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:48:29,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:48:29,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:48:29,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:48:29,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:48:29,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... [2019-12-07 19:48:29,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:48:29,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:48:29,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:48:29,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:48:29,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/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 [2019-12-07 19:48:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:48:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:48:29,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:48:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:48:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:48:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:48:29,748 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:48:29,748 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 19:48:29,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:48:29 BoogieIcfgContainer [2019-12-07 19:48:29,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:48:29,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:48:29,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:48:29,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:48:29,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:48:29" (1/3) ... [2019-12-07 19:48:29,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5299ec33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:48:29, skipping insertion in model container [2019-12-07 19:48:29,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:48:29" (2/3) ... [2019-12-07 19:48:29,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5299ec33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:48:29, skipping insertion in model container [2019-12-07 19:48:29,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:48:29" (3/3) ... [2019-12-07 19:48:29,754 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-read.c [2019-12-07 19:48:29,760 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:48:29,764 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-12-07 19:48:29,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-07 19:48:29,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:48:29,785 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:48:29,785 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:48:29,785 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:48:29,785 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:48:29,785 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:48:29,785 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:48:29,785 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:48:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-12-07 19:48:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 19:48:29,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:29,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 19:48:29,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash 3150815, now seen corresponding path program 1 times [2019-12-07 19:48:29,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:29,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634485812] [2019-12-07 19:48:29,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634485812] [2019-12-07 19:48:29,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:48:29,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:48:29,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188142636] [2019-12-07 19:48:29,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:48:29,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:29,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:48:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:48:29,915 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-12-07 19:48:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:29,954 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-12-07 19:48:29,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:48:29,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 19:48:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:29,964 INFO L225 Difference]: With dead ends: 37 [2019-12-07 19:48:29,964 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 19:48:29,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:48:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 19:48:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2019-12-07 19:48:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 19:48:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 19:48:29,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 4 [2019-12-07 19:48:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:29,987 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 19:48:29,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:48:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 19:48:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 19:48:29,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:29,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 19:48:29,988 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash 3078660, now seen corresponding path program 1 times [2019-12-07 19:48:29,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:29,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531922206] [2019-12-07 19:48:29,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:30,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531922206] [2019-12-07 19:48:30,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:48:30,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:48:30,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332856316] [2019-12-07 19:48:30,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:48:30,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:30,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:48:30,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:48:30,020 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 3 states. [2019-12-07 19:48:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:30,036 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-12-07 19:48:30,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:48:30,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 19:48:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:30,037 INFO L225 Difference]: With dead ends: 37 [2019-12-07 19:48:30,037 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 19:48:30,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:48:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 19:48:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2019-12-07 19:48:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 19:48:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-12-07 19:48:30,041 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 4 [2019-12-07 19:48:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:30,041 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-12-07 19:48:30,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:48:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-12-07 19:48:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 19:48:30,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:30,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 19:48:30,041 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash 3080752, now seen corresponding path program 1 times [2019-12-07 19:48:30,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:30,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564877827] [2019-12-07 19:48:30,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:30,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564877827] [2019-12-07 19:48:30,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:48:30,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:48:30,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394609807] [2019-12-07 19:48:30,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:48:30,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:48:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:48:30,073 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-12-07 19:48:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:30,119 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-12-07 19:48:30,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:48:30,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 19:48:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:30,120 INFO L225 Difference]: With dead ends: 42 [2019-12-07 19:48:30,120 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 19:48:30,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:48:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 19:48:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2019-12-07 19:48:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 19:48:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-12-07 19:48:30,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 4 [2019-12-07 19:48:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:30,123 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-12-07 19:48:30,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:48:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-12-07 19:48:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:48:30,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:30,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:48:30,124 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:30,124 INFO L82 PathProgramCache]: Analyzing trace with hash 95438513, now seen corresponding path program 1 times [2019-12-07 19:48:30,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:30,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7073615] [2019-12-07 19:48:30,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:30,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7073615] [2019-12-07 19:48:30,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:48:30,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:48:30,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687317875] [2019-12-07 19:48:30,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:48:30,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:30,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:48:30,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:48:30,149 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-12-07 19:48:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:30,171 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-12-07 19:48:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:48:30,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 19:48:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:30,172 INFO L225 Difference]: With dead ends: 22 [2019-12-07 19:48:30,172 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 19:48:30,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:48:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 19:48:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 19:48:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 19:48:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-12-07 19:48:30,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2019-12-07 19:48:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:30,174 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-12-07 19:48:30,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:48:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-12-07 19:48:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:48:30,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:30,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:48:30,175 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash 95438514, now seen corresponding path program 1 times [2019-12-07 19:48:30,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:30,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572580598] [2019-12-07 19:48:30,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:30,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572580598] [2019-12-07 19:48:30,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:48:30,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:48:30,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099736750] [2019-12-07 19:48:30,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:48:30,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:30,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:48:30,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:48:30,236 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 6 states. [2019-12-07 19:48:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:30,312 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-12-07 19:48:30,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:48:30,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-12-07 19:48:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:30,313 INFO L225 Difference]: With dead ends: 39 [2019-12-07 19:48:30,313 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 19:48:30,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:48:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 19:48:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2019-12-07 19:48:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 19:48:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-12-07 19:48:30,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 5 [2019-12-07 19:48:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:30,316 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-12-07 19:48:30,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:48:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-12-07 19:48:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:48:30,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:30,316 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 19:48:30,316 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1522149287, now seen corresponding path program 1 times [2019-12-07 19:48:30,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:30,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460582376] [2019-12-07 19:48:30,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:30,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460582376] [2019-12-07 19:48:30,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229000473] [2019-12-07 19:48:30,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/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 [2019-12-07 19:48:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:30,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:48:30,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:30,407 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:30,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1551468497] [2019-12-07 19:48:30,442 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2019-12-07 19:48:30,442 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:30,446 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:30,450 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:30,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:30,767 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:31,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:31,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3, 3] total 12 [2019-12-07 19:48:31,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410781938] [2019-12-07 19:48:31,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:48:31,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:31,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:48:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:48:31,088 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 5 states. [2019-12-07 19:48:31,324 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-12-07 19:48:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:31,373 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-12-07 19:48:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:48:31,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 19:48:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:31,375 INFO L225 Difference]: With dead ends: 27 [2019-12-07 19:48:31,375 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 19:48:31,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:48:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 19:48:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-12-07 19:48:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 19:48:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-12-07 19:48:31,379 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 7 [2019-12-07 19:48:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:31,379 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-12-07 19:48:31,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:48:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-12-07 19:48:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:48:31,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:31,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:48:31,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:31,581 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash 148382999, now seen corresponding path program 1 times [2019-12-07 19:48:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430449461] [2019-12-07 19:48:31,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:48:31,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430449461] [2019-12-07 19:48:31,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:48:31,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:48:31,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362544848] [2019-12-07 19:48:31,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:48:31,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:31,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:48:31,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:48:31,641 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-12-07 19:48:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:31,653 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-12-07 19:48:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:48:31,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 19:48:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:31,654 INFO L225 Difference]: With dead ends: 24 [2019-12-07 19:48:31,654 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 19:48:31,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:48:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 19:48:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 19:48:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 19:48:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-12-07 19:48:31,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 10 [2019-12-07 19:48:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:31,658 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-12-07 19:48:31,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:48:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-12-07 19:48:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:48:31,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:31,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:48:31,659 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash 148383000, now seen corresponding path program 1 times [2019-12-07 19:48:31,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:31,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725722826] [2019-12-07 19:48:31,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:48:31,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725722826] [2019-12-07 19:48:31,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832089322] [2019-12-07 19:48:31,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/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 [2019-12-07 19:48:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:31,710 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:48:31,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:31,728 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:31,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1137327317] [2019-12-07 19:48:31,744 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 19:48:31,744 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:31,744 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:31,744 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:31,745 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:31,789 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:31,938 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:31,943 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:32,256 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:32,463 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:32,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:32,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3, 4, 4] total 14 [2019-12-07 19:48:32,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263484238] [2019-12-07 19:48:32,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:48:32,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:48:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:48:32,824 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 8 states. [2019-12-07 19:48:33,074 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-12-07 19:48:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:33,156 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-12-07 19:48:33,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:48:33,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 19:48:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:33,157 INFO L225 Difference]: With dead ends: 27 [2019-12-07 19:48:33,157 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 19:48:33,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:48:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 19:48:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-12-07 19:48:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 19:48:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-12-07 19:48:33,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2019-12-07 19:48:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:33,159 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-12-07 19:48:33,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:48:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-12-07 19:48:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:48:33,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:33,160 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 19:48:33,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:33,362 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash 302699209, now seen corresponding path program 1 times [2019-12-07 19:48:33,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:33,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39926147] [2019-12-07 19:48:33,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:48:33,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39926147] [2019-12-07 19:48:33,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495389545] [2019-12-07 19:48:33,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/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 [2019-12-07 19:48:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:33,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:48:33,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:33,473 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:48:33,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248297235] [2019-12-07 19:48:33,494 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:33,494 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:33,494 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:33,494 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:33,494 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:33,529 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:33,623 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:33,628 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:33,845 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:34,220 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:34,378 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-12-07 19:48:34,685 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:34,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:34,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2019-12-07 19:48:34,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057722221] [2019-12-07 19:48:34,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:48:34,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:48:34,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:48:34,687 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 12 states. [2019-12-07 19:48:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:35,132 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-12-07 19:48:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:48:35,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-12-07 19:48:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:35,133 INFO L225 Difference]: With dead ends: 76 [2019-12-07 19:48:35,133 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 19:48:35,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 19:48:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 19:48:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 42. [2019-12-07 19:48:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 19:48:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-12-07 19:48:35,136 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 11 [2019-12-07 19:48:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:35,136 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-12-07 19:48:35,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:48:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-12-07 19:48:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:48:35,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:35,137 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1] [2019-12-07 19:48:35,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:35,338 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:35,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1984378557, now seen corresponding path program 1 times [2019-12-07 19:48:35,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:35,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417666254] [2019-12-07 19:48:35,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:48:35,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417666254] [2019-12-07 19:48:35,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063972514] [2019-12-07 19:48:35,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/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 [2019-12-07 19:48:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:35,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:48:35,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:48:35,435 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:48:35,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [532846899] [2019-12-07 19:48:35,455 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:35,455 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:35,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:35,455 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:35,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:35,490 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:35,583 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:35,589 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:35,826 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:36,194 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:36,485 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:36,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:36,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-12-07 19:48:36,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426309507] [2019-12-07 19:48:36,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:48:36,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:48:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:48:36,486 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 12 states. [2019-12-07 19:48:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:36,615 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-12-07 19:48:36,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:48:36,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-07 19:48:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:36,616 INFO L225 Difference]: With dead ends: 55 [2019-12-07 19:48:36,616 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 19:48:36,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-12-07 19:48:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 19:48:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-12-07 19:48:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 19:48:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-12-07 19:48:36,619 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 19 [2019-12-07 19:48:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:36,619 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-12-07 19:48:36,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:48:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-12-07 19:48:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:48:36,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:36,619 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1] [2019-12-07 19:48:36,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:36,821 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash 629479323, now seen corresponding path program 1 times [2019-12-07 19:48:36,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:36,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829128369] [2019-12-07 19:48:36,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:48:36,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829128369] [2019-12-07 19:48:36,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510234021] [2019-12-07 19:48:36,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:36,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:48:36,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:48:36,963 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:48:36,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247222127] [2019-12-07 19:48:36,988 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:36,988 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:36,988 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:36,988 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:36,988 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:37,019 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:37,113 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:37,117 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:37,351 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:37,664 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:37,891 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-07 19:48:38,066 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-07 19:48:38,312 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-07 19:48:38,314 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:38,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:38,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2019-12-07 19:48:38,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065166060] [2019-12-07 19:48:38,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:48:38,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:38,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:48:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:48:38,317 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 14 states. [2019-12-07 19:48:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:38,683 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-12-07 19:48:38,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 19:48:38,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-07 19:48:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:38,684 INFO L225 Difference]: With dead ends: 73 [2019-12-07 19:48:38,684 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 19:48:38,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:48:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 19:48:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2019-12-07 19:48:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 19:48:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-12-07 19:48:38,689 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-12-07 19:48:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:38,689 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-12-07 19:48:38,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:48:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-12-07 19:48:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:48:38,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:38,690 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1] [2019-12-07 19:48:38,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:38,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash 629481416, now seen corresponding path program 2 times [2019-12-07 19:48:38,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:38,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078337191] [2019-12-07 19:48:38,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 19:48:38,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078337191] [2019-12-07 19:48:38,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790771136] [2019-12-07 19:48:38,965 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:38,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 19:48:38,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:48:38,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:48:38,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 19:48:39,054 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 19:48:39,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1140838407] [2019-12-07 19:48:39,077 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:39,077 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:39,077 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:39,077 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:39,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:39,118 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:39,226 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:39,230 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:39,474 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:39,784 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:40,077 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:40,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:40,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2019-12-07 19:48:40,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655017251] [2019-12-07 19:48:40,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:48:40,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:40,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:48:40,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:48:40,078 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 9 states. [2019-12-07 19:48:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:40,223 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-12-07 19:48:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:48:40,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 19:48:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:40,224 INFO L225 Difference]: With dead ends: 60 [2019-12-07 19:48:40,224 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 19:48:40,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:48:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 19:48:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-12-07 19:48:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 19:48:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2019-12-07 19:48:40,228 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 22 [2019-12-07 19:48:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:40,228 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2019-12-07 19:48:40,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:48:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2019-12-07 19:48:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:48:40,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:40,228 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 2, 2, 1, 1] [2019-12-07 19:48:40,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:40,430 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1657493315, now seen corresponding path program 2 times [2019-12-07 19:48:40,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:40,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697116959] [2019-12-07 19:48:40,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 19:48:40,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697116959] [2019-12-07 19:48:40,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237907221] [2019-12-07 19:48:40,526 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:40,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 19:48:40,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:48:40,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 19:48:40,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 19:48:40,594 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 19:48:40,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [274722513] [2019-12-07 19:48:40,623 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:40,623 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:40,623 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:40,623 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:40,623 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:40,658 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:40,757 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:40,761 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:40,963 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:41,252 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:41,558 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:41,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:41,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 2, 2] total 10 [2019-12-07 19:48:41,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513084485] [2019-12-07 19:48:41,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:48:41,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:48:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:48:41,559 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 12 states. [2019-12-07 19:48:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:42,251 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-12-07 19:48:42,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:48:42,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-07 19:48:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:42,252 INFO L225 Difference]: With dead ends: 66 [2019-12-07 19:48:42,253 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 19:48:42,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:48:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 19:48:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-12-07 19:48:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 19:48:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-12-07 19:48:42,257 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 26 [2019-12-07 19:48:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:42,257 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-12-07 19:48:42,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:48:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-12-07 19:48:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 19:48:42,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:42,258 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 1, 1] [2019-12-07 19:48:42,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:42,460 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1005765662, now seen corresponding path program 2 times [2019-12-07 19:48:42,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:42,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223289316] [2019-12-07 19:48:42,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 5 proven. 141 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 19:48:42,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223289316] [2019-12-07 19:48:42,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892881295] [2019-12-07 19:48:42,597 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:42,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 19:48:42,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:48:42,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:48:42,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 76 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 19:48:42,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 19:48:42,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [184433775] [2019-12-07 19:48:42,680 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:42,680 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:42,680 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:42,680 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:42,680 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:42,714 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:42,804 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:42,808 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:43,002 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:43,439 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:43,598 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-12-07 19:48:43,788 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-07 19:48:43,973 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-07 19:48:44,207 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-07 19:48:44,208 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:44,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:44,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2019-12-07 19:48:44,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096006388] [2019-12-07 19:48:44,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:48:44,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:44,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:48:44,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:48:44,209 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 16 states. [2019-12-07 19:48:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:44,466 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-12-07 19:48:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:48:44,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-12-07 19:48:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:44,466 INFO L225 Difference]: With dead ends: 50 [2019-12-07 19:48:44,466 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 19:48:44,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2019-12-07 19:48:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 19:48:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-12-07 19:48:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 19:48:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-12-07 19:48:44,469 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 43 [2019-12-07 19:48:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:44,469 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-12-07 19:48:44,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:48:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-12-07 19:48:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 19:48:44,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:44,470 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 4, 3, 3, 1, 1] [2019-12-07 19:48:44,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:44,671 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1100542029, now seen corresponding path program 3 times [2019-12-07 19:48:44,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:44,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049573018] [2019-12-07 19:48:44,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 19:48:44,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049573018] [2019-12-07 19:48:44,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481825778] [2019-12-07 19:48:44,763 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:44,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:48:44,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:48:44,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:48:44,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 19:48:44,860 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 19:48:44,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [602148403] [2019-12-07 19:48:44,919 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:44,919 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:44,919 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:44,919 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:44,919 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:44,949 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:45,036 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:45,040 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:45,238 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:45,558 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:45,897 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:45,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:45,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2019-12-07 19:48:45,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346132435] [2019-12-07 19:48:45,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 19:48:45,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 19:48:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-12-07 19:48:45,899 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 20 states. [2019-12-07 19:48:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:46,747 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-12-07 19:48:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 19:48:46,748 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-12-07 19:48:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:46,748 INFO L225 Difference]: With dead ends: 84 [2019-12-07 19:48:46,748 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 19:48:46,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=592, Invalid=2488, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 19:48:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 19:48:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-12-07 19:48:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 19:48:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-12-07 19:48:46,752 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 47 [2019-12-07 19:48:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:46,752 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-12-07 19:48:46,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 19:48:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-12-07 19:48:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:48:46,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:46,753 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 5, 4, 4, 1, 1] [2019-12-07 19:48:46,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:46,954 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:46,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash -444216156, now seen corresponding path program 4 times [2019-12-07 19:48:46,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:46,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107279927] [2019-12-07 19:48:46,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 19:48:47,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107279927] [2019-12-07 19:48:47,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396062119] [2019-12-07 19:48:47,080 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:47,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 19:48:47,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 287 proven. 154 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 19:48:47,201 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 287 proven. 154 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 19:48:47,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [667188629] [2019-12-07 19:48:47,283 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:47,284 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:47,284 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:47,284 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:47,284 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:47,313 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:47,402 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:47,406 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:47,624 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:47,931 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:48,334 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:48,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:48,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 23 [2019-12-07 19:48:48,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080060349] [2019-12-07 19:48:48,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 19:48:48,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:48,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 19:48:48,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2019-12-07 19:48:48,335 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 24 states. [2019-12-07 19:48:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:49,484 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-12-07 19:48:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 19:48:49,484 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2019-12-07 19:48:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:49,485 INFO L225 Difference]: With dead ends: 110 [2019-12-07 19:48:49,485 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 19:48:49,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=842, Invalid=3850, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 19:48:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 19:48:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2019-12-07 19:48:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:48:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2019-12-07 19:48:49,489 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 65 [2019-12-07 19:48:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:49,489 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2019-12-07 19:48:49,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 19:48:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2019-12-07 19:48:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 19:48:49,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:49,490 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 22, 6, 5, 5, 1, 1] [2019-12-07 19:48:49,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:49,692 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash -697106376, now seen corresponding path program 5 times [2019-12-07 19:48:49,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:49,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925293157] [2019-12-07 19:48:49,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 0 proven. 788 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 19:48:49,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925293157] [2019-12-07 19:48:49,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441187556] [2019-12-07 19:48:49,858 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:49,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 19:48:49,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:48:49,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 19:48:49,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-12-07 19:48:49,996 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-12-07 19:48:50,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924395254] [2019-12-07 19:48:50,103 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:50,103 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:50,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:50,104 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:50,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:50,136 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:50,228 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:50,233 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:50,448 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:50,767 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:51,087 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:51,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:51,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 21 [2019-12-07 19:48:51,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255125502] [2019-12-07 19:48:51,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 19:48:51,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:51,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 19:48:51,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2019-12-07 19:48:51,088 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 23 states. [2019-12-07 19:48:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:53,407 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2019-12-07 19:48:53,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 19:48:53,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2019-12-07 19:48:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:53,409 INFO L225 Difference]: With dead ends: 138 [2019-12-07 19:48:53,409 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 19:48:53,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1552, Invalid=3704, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 19:48:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 19:48:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2019-12-07 19:48:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 19:48:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2019-12-07 19:48:53,413 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 86 [2019-12-07 19:48:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:53,413 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2019-12-07 19:48:53,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 19:48:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2019-12-07 19:48:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 19:48:53,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:53,414 INFO L410 BasicCegarLoop]: trace histogram [34, 34, 33, 7, 6, 6, 1, 1] [2019-12-07 19:48:53,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:53,616 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1448152351, now seen corresponding path program 6 times [2019-12-07 19:48:53,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:53,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450400262] [2019-12-07 19:48:53,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 166 proven. 1628 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 19:48:53,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450400262] [2019-12-07 19:48:53,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398074724] [2019-12-07 19:48:53,803 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:53,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:48:53,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:48:53,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 19:48:53,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 1325 proven. 369 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-12-07 19:48:54,033 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 1325 proven. 369 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-12-07 19:48:54,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [319399003] [2019-12-07 19:48:54,208 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:54,208 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:54,208 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:54,209 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:54,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:54,247 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:54,345 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:54,350 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:54,553 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:54,896 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:55,260 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:55,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:55,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 38 [2019-12-07 19:48:55,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850224841] [2019-12-07 19:48:55,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 19:48:55,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 19:48:55,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 19:48:55,262 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 39 states. [2019-12-07 19:48:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:48:56,502 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-12-07 19:48:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-07 19:48:56,502 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 122 [2019-12-07 19:48:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:48:56,503 INFO L225 Difference]: With dead ends: 161 [2019-12-07 19:48:56,503 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 19:48:56,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 335 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1439, Invalid=7873, Unknown=0, NotChecked=0, Total=9312 [2019-12-07 19:48:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 19:48:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-12-07 19:48:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 19:48:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-12-07 19:48:56,508 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 122 [2019-12-07 19:48:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:48:56,508 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-12-07 19:48:56,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 19:48:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-12-07 19:48:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 19:48:56,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:48:56,510 INFO L410 BasicCegarLoop]: trace histogram [44, 44, 43, 8, 7, 7, 1, 1] [2019-12-07 19:48:56,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:56,710 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:48:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:48:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash 38216525, now seen corresponding path program 7 times [2019-12-07 19:48:56,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:48:56,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738498112] [2019-12-07 19:48:56,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:48:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 186 proven. 2765 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-12-07 19:48:56,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738498112] [2019-12-07 19:48:56,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857670843] [2019-12-07 19:48:56,921 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:48:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:48:56,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 19:48:56,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:48:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 2174 proven. 712 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-12-07 19:48:57,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:48:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 2174 proven. 712 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-12-07 19:48:57,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60030410] [2019-12-07 19:48:57,437 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:48:57,437 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:48:57,437 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:48:57,437 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:48:57,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:48:57,467 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:57,554 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:57,558 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:48:57,758 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:48:58,122 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:48:58,514 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:48:58,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:48:58,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 43 [2019-12-07 19:48:58,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181524244] [2019-12-07 19:48:58,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 19:48:58,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:48:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 19:48:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2140, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 19:48:58,516 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 44 states. [2019-12-07 19:49:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:49:00,349 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2019-12-07 19:49:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-07 19:49:00,349 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 155 [2019-12-07 19:49:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:49:00,350 INFO L225 Difference]: With dead ends: 191 [2019-12-07 19:49:00,350 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 19:49:00,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 428 SyntacticMatches, 7 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3751 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1872, Invalid=11010, Unknown=0, NotChecked=0, Total=12882 [2019-12-07 19:49:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 19:49:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2019-12-07 19:49:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-12-07 19:49:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 192 transitions. [2019-12-07 19:49:00,356 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 192 transitions. Word has length 155 [2019-12-07 19:49:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:49:00,356 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 192 transitions. [2019-12-07 19:49:00,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 19:49:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 192 transitions. [2019-12-07 19:49:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 19:49:00,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:49:00,358 INFO L410 BasicCegarLoop]: trace histogram [53, 53, 52, 9, 8, 8, 1, 1] [2019-12-07 19:49:00,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:00,559 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:49:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:49:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1316911140, now seen corresponding path program 8 times [2019-12-07 19:49:00,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:49:00,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910829624] [2019-12-07 19:49:00,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:49:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:49:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 3033 proven. 1206 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-12-07 19:49:00,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910829624] [2019-12-07 19:49:00,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850098181] [2019-12-07 19:49:00,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:00,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 19:49:00,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:49:00,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 19:49:00,869 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:49:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 0 proven. 1505 refuted. 0 times theorem prover too weak. 3145 trivial. 0 not checked. [2019-12-07 19:49:01,166 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:49:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 0 proven. 1505 refuted. 0 times theorem prover too weak. 3145 trivial. 0 not checked. [2019-12-07 19:49:01,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [357712344] [2019-12-07 19:49:01,638 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:49:01,638 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:49:01,638 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:49:01,638 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:49:01,638 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:49:01,667 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:01,765 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:01,770 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:01,963 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:49:02,324 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:49:02,944 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-07 19:49:03,410 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-07 19:49:03,421 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:49:03,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:49:03,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 12] total 46 [2019-12-07 19:49:03,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621670351] [2019-12-07 19:49:03,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 19:49:03,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:49:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 19:49:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=2274, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 19:49:03,427 INFO L87 Difference]: Start difference. First operand 189 states and 192 transitions. Second operand 46 states. [2019-12-07 19:49:05,412 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:49:05,643 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-07 19:49:05,968 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:06,562 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:06,732 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-07 19:49:06,936 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:49:07,163 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:49:07,398 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-07 19:49:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:49:10,647 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2019-12-07 19:49:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-07 19:49:10,648 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 185 [2019-12-07 19:49:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:49:10,649 INFO L225 Difference]: With dead ends: 244 [2019-12-07 19:49:10,649 INFO L226 Difference]: Without dead ends: 244 [2019-12-07 19:49:10,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5420 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4030, Invalid=15992, Unknown=0, NotChecked=0, Total=20022 [2019-12-07 19:49:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-07 19:49:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 222. [2019-12-07 19:49:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 19:49:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 234 transitions. [2019-12-07 19:49:10,657 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 234 transitions. Word has length 185 [2019-12-07 19:49:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:49:10,657 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 234 transitions. [2019-12-07 19:49:10,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 19:49:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 234 transitions. [2019-12-07 19:49:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 19:49:10,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:49:10,659 INFO L410 BasicCegarLoop]: trace histogram [65, 65, 64, 9, 8, 8, 1, 1] [2019-12-07 19:49:10,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:10,860 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:49:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:49:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash 971200818, now seen corresponding path program 9 times [2019-12-07 19:49:10,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:49:10,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463249434] [2019-12-07 19:49:10,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:49:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:49:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6852 backedges. 679 proven. 5769 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-12-07 19:49:11,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463249434] [2019-12-07 19:49:11,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610834327] [2019-12-07 19:49:11,327 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:11,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:49:11,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:49:11,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 19:49:11,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:49:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6852 backedges. 718 proven. 5730 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-12-07 19:49:12,059 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:49:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6852 backedges. 718 proven. 5730 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-12-07 19:49:12,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [305765477] [2019-12-07 19:49:12,533 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:49:12,533 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:49:12,533 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:49:12,533 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:49:12,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:49:12,563 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:12,651 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:12,656 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:12,854 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:49:13,067 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-07 19:49:13,452 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:49:13,964 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:49:13,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:49:13,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 73 [2019-12-07 19:49:13,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522106527] [2019-12-07 19:49:13,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-12-07 19:49:13,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:49:13,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-12-07 19:49:13,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1493, Invalid=4827, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 19:49:13,966 INFO L87 Difference]: Start difference. First operand 222 states and 234 transitions. Second operand 74 states. [2019-12-07 19:49:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:49:24,739 INFO L93 Difference]: Finished difference Result 717 states and 793 transitions. [2019-12-07 19:49:24,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-12-07 19:49:24,740 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 221 [2019-12-07 19:49:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:49:24,743 INFO L225 Difference]: With dead ends: 717 [2019-12-07 19:49:24,743 INFO L226 Difference]: Without dead ends: 717 [2019-12-07 19:49:24,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 604 SyntacticMatches, 11 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48426 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=25212, Invalid=68118, Unknown=0, NotChecked=0, Total=93330 [2019-12-07 19:49:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-12-07 19:49:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 714. [2019-12-07 19:49:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-12-07 19:49:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 790 transitions. [2019-12-07 19:49:24,759 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 790 transitions. Word has length 221 [2019-12-07 19:49:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:49:24,760 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 790 transitions. [2019-12-07 19:49:24,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-12-07 19:49:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 790 transitions. [2019-12-07 19:49:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-12-07 19:49:24,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:49:24,763 INFO L410 BasicCegarLoop]: trace histogram [155, 155, 154, 19, 18, 18, 1, 1] [2019-12-07 19:49:24,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:24,964 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:49:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:49:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 371184344, now seen corresponding path program 10 times [2019-12-07 19:49:24,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:49:24,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958887320] [2019-12-07 19:49:24,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:49:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:49:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 0 proven. 36908 refuted. 0 times theorem prover too weak. 2164 trivial. 0 not checked. [2019-12-07 19:49:26,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958887320] [2019-12-07 19:49:26,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535604964] [2019-12-07 19:49:26,182 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:49:26,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 2105 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 19:49:26,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:49:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 20742 proven. 1429 refuted. 0 times theorem prover too weak. 16901 trivial. 0 not checked. [2019-12-07 19:49:26,812 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:49:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 20742 proven. 1429 refuted. 0 times theorem prover too weak. 16901 trivial. 0 not checked. [2019-12-07 19:49:27,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [673238399] [2019-12-07 19:49:27,282 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:49:27,282 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:49:27,282 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:49:27,283 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:49:27,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:49:27,313 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:27,398 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:27,402 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:27,595 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:49:28,001 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:49:28,299 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-07 19:49:28,623 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:49:28,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:49:28,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 52 [2019-12-07 19:49:28,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302076223] [2019-12-07 19:49:28,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 19:49:28,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:49:28,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 19:49:28,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=2937, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 19:49:28,626 INFO L87 Difference]: Start difference. First operand 714 states and 790 transitions. Second operand 53 states. [2019-12-07 19:49:29,392 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-07 19:49:33,381 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:33,604 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:35,673 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-07 19:49:36,344 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:36,594 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:36,872 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:37,157 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:37,466 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:41,634 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:43,640 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:44,110 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-07 19:49:45,441 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:45,896 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:46,368 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-07 19:49:46,943 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:49:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:49:49,401 INFO L93 Difference]: Finished difference Result 801 states and 877 transitions. [2019-12-07 19:49:49,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2019-12-07 19:49:49,402 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 521 [2019-12-07 19:49:49,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:49:49,405 INFO L225 Difference]: With dead ends: 801 [2019-12-07 19:49:49,405 INFO L226 Difference]: Without dead ends: 801 [2019-12-07 19:49:49,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1800 GetRequests, 1517 SyntacticMatches, 9 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28065 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=14283, Invalid=61617, Unknown=0, NotChecked=0, Total=75900 [2019-12-07 19:49:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-12-07 19:49:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 747. [2019-12-07 19:49:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 19:49:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 813 transitions. [2019-12-07 19:49:49,415 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 813 transitions. Word has length 521 [2019-12-07 19:49:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:49:49,415 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 813 transitions. [2019-12-07 19:49:49,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 19:49:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 813 transitions. [2019-12-07 19:49:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-12-07 19:49:49,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:49:49,418 INFO L410 BasicCegarLoop]: trace histogram [175, 175, 174, 20, 19, 19, 1, 1] [2019-12-07 19:49:49,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:49,619 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:49:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:49:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1739212602, now seen corresponding path program 11 times [2019-12-07 19:49:49,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:49:49,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989034935] [2019-12-07 19:49:49,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:49:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:49:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 49532 backedges. 0 proven. 46943 refuted. 0 times theorem prover too weak. 2589 trivial. 0 not checked. [2019-12-07 19:49:51,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989034935] [2019-12-07 19:49:51,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86268209] [2019-12-07 19:49:51,013 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:49:51,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-07 19:49:51,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:49:51,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 19:49:51,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:49:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 49532 backedges. 4699 proven. 10286 refuted. 0 times theorem prover too weak. 34547 trivial. 0 not checked. [2019-12-07 19:49:52,156 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:49:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 49532 backedges. 0 proven. 14985 refuted. 0 times theorem prover too weak. 34547 trivial. 0 not checked. [2019-12-07 19:49:54,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [444291612] [2019-12-07 19:49:54,223 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:49:54,223 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:49:54,223 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:49:54,224 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:49:54,224 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:49:54,254 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:54,342 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:54,348 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:49:54,559 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:49:54,904 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:49:55,316 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:49:55,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:49:55,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 55 [2019-12-07 19:49:55,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303338116] [2019-12-07 19:49:55,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 19:49:55,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:49:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 19:49:55,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=904, Invalid=3002, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 19:49:55,319 INFO L87 Difference]: Start difference. First operand 747 states and 813 transitions. Second operand 57 states. [2019-12-07 19:49:57,968 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 19:49:58,276 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 19:49:58,578 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 19:49:58,927 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 19:50:01,480 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 19:50:02,106 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 19:50:05,277 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 19:50:05,819 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 19:50:06,367 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 19:50:06,976 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 19:50:08,309 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 19:50:08,905 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 19:50:11,716 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 19:50:17,121 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 19:50:18,141 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 19:50:18,830 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 19:50:19,566 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 19:50:22,458 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-12-07 19:50:23,067 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-12-07 19:50:23,568 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-12-07 19:50:24,414 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2019-12-07 19:50:25,817 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2019-12-07 19:50:26,642 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2019-12-07 19:50:27,663 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-12-07 19:50:28,196 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-12-07 19:50:29,042 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-07 19:50:29,307 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-12-07 19:50:29,772 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-07 19:50:30,903 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-07 19:50:31,633 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-12-07 19:50:32,332 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-07 19:50:33,126 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-12-07 19:50:34,046 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-12-07 19:50:34,552 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-12-07 19:50:39,075 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-07 19:50:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:50:40,796 INFO L93 Difference]: Finished difference Result 4075 states and 4592 transitions. [2019-12-07 19:50:40,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2019-12-07 19:50:40,796 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 584 [2019-12-07 19:50:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:50:40,809 INFO L225 Difference]: With dead ends: 4075 [2019-12-07 19:50:40,809 INFO L226 Difference]: Without dead ends: 4075 [2019-12-07 19:50:40,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2075 GetRequests, 1712 SyntacticMatches, 0 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60881 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=43490, Invalid=89370, Unknown=0, NotChecked=0, Total=132860 [2019-12-07 19:50:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2019-12-07 19:50:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3235. [2019-12-07 19:50:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3235 states. [2019-12-07 19:50:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 3616 transitions. [2019-12-07 19:50:40,850 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 3616 transitions. Word has length 584 [2019-12-07 19:50:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:50:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 3235 states and 3616 transitions. [2019-12-07 19:50:40,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 19:50:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 3616 transitions. [2019-12-07 19:50:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2019-12-07 19:50:40,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:50:40,858 INFO L410 BasicCegarLoop]: trace histogram [229, 229, 228, 23, 22, 22, 1, 1] [2019-12-07 19:50:41,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:50:41,058 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:50:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:50:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash -79318946, now seen corresponding path program 12 times [2019-12-07 19:50:41,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:50:41,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097747078] [2019-12-07 19:50:41,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:50:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:50:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 84071 backedges. 70291 proven. 7074 refuted. 0 times theorem prover too weak. 6706 trivial. 0 not checked. [2019-12-07 19:50:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097747078] [2019-12-07 19:50:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577135455] [2019-12-07 19:50:42,042 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:50:42,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:50:42,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:50:42,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 2961 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 19:50:42,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:50:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 84071 backedges. 69894 proven. 5594 refuted. 0 times theorem prover too weak. 8583 trivial. 0 not checked. [2019-12-07 19:50:43,498 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:50:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 84071 backedges. 69894 proven. 5594 refuted. 0 times theorem prover too weak. 8583 trivial. 0 not checked. [2019-12-07 19:50:44,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [191339343] [2019-12-07 19:50:44,317 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:50:44,317 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:50:44,317 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:50:44,318 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:50:44,318 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:50:44,348 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:50:44,435 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:50:44,439 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:50:44,631 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:50:44,992 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:50:45,568 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-07 19:50:45,930 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-07 19:50:45,943 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:50:45,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:50:45,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32, 32] total 67 [2019-12-07 19:50:45,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045054126] [2019-12-07 19:50:45,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-07 19:50:45,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:50:45,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-07 19:50:45,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1053, Invalid=4203, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 19:50:45,945 INFO L87 Difference]: Start difference. First operand 3235 states and 3616 transitions. Second operand 67 states. [2019-12-07 19:51:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:51:00,539 INFO L93 Difference]: Finished difference Result 982 states and 999 transitions. [2019-12-07 19:51:00,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2019-12-07 19:51:00,539 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 755 [2019-12-07 19:51:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:51:00,543 INFO L225 Difference]: With dead ends: 982 [2019-12-07 19:51:00,543 INFO L226 Difference]: Without dead ends: 982 [2019-12-07 19:51:00,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2551 GetRequests, 2216 SyntacticMatches, 14 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31156 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=28697, Invalid=75309, Unknown=0, NotChecked=0, Total=104006 [2019-12-07 19:51:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-07 19:51:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2019-12-07 19:51:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-12-07 19:51:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 999 transitions. [2019-12-07 19:51:00,556 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 999 transitions. Word has length 755 [2019-12-07 19:51:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:51:00,557 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 999 transitions. [2019-12-07 19:51:00,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-12-07 19:51:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 999 transitions. [2019-12-07 19:51:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2019-12-07 19:51:00,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:51:00,565 INFO L410 BasicCegarLoop]: trace histogram [294, 294, 293, 23, 22, 22, 1, 1] [2019-12-07 19:51:00,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:51:00,766 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:51:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:51:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2031149551, now seen corresponding path program 13 times [2019-12-07 19:51:00,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:51:00,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851620058] [2019-12-07 19:51:00,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:51:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:51:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 136396 backedges. 111503 proven. 17300 refuted. 0 times theorem prover too weak. 7593 trivial. 0 not checked. [2019-12-07 19:51:02,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851620058] [2019-12-07 19:51:02,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775593225] [2019-12-07 19:51:02,292 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:51:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:51:02,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 3611 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 19:51:02,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:51:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 136396 backedges. 112981 proven. 15811 refuted. 0 times theorem prover too weak. 7604 trivial. 0 not checked. [2019-12-07 19:51:03,759 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:51:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 136396 backedges. 112981 proven. 15811 refuted. 0 times theorem prover too weak. 7604 trivial. 0 not checked. [2019-12-07 19:51:04,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [109232978] [2019-12-07 19:51:04,955 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:51:04,955 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:51:04,955 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:51:04,955 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:51:04,955 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:51:04,985 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:51:05,071 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:51:05,076 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:51:05,264 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:51:05,653 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:51:06,098 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:51:06,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:51:06,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44, 44] total 72 [2019-12-07 19:51:06,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225614007] [2019-12-07 19:51:06,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-12-07 19:51:06,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:51:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-12-07 19:51:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1144, Invalid=4862, Unknown=0, NotChecked=0, Total=6006 [2019-12-07 19:51:06,101 INFO L87 Difference]: Start difference. First operand 982 states and 999 transitions. Second operand 72 states. [2019-12-07 19:51:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:51:26,593 INFO L93 Difference]: Finished difference Result 993 states and 1007 transitions. [2019-12-07 19:51:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2019-12-07 19:51:26,594 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 950 [2019-12-07 19:51:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:51:26,597 INFO L225 Difference]: With dead ends: 993 [2019-12-07 19:51:26,597 INFO L226 Difference]: Without dead ends: 993 [2019-12-07 19:51:26,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3173 GetRequests, 2782 SyntacticMatches, 41 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38788 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=31608, Invalid=91944, Unknown=0, NotChecked=0, Total=123552 [2019-12-07 19:51:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-07 19:51:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 985. [2019-12-07 19:51:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-07 19:51:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1000 transitions. [2019-12-07 19:51:26,607 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1000 transitions. Word has length 950 [2019-12-07 19:51:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:51:26,608 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1000 transitions. [2019-12-07 19:51:26,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-12-07 19:51:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1000 transitions. [2019-12-07 19:51:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 954 [2019-12-07 19:51:26,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:51:26,614 INFO L410 BasicCegarLoop]: trace histogram [295, 295, 294, 23, 22, 22, 1, 1] [2019-12-07 19:51:26,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:51:26,814 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:51:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:51:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash 808373714, now seen corresponding path program 14 times [2019-12-07 19:51:26,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:51:26,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413941398] [2019-12-07 19:51:26,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:51:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:51:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 137300 backedges. 111395 proven. 19721 refuted. 0 times theorem prover too weak. 6184 trivial. 0 not checked. [2019-12-07 19:51:28,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413941398] [2019-12-07 19:51:28,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519975863] [2019-12-07 19:51:28,396 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:51:28,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-12-07 19:51:28,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:51:28,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 19:51:28,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:51:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 137300 backedges. 0 proven. 18354 refuted. 0 times theorem prover too weak. 118946 trivial. 0 not checked. [2019-12-07 19:51:31,097 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:51:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 137300 backedges. 0 proven. 18354 refuted. 0 times theorem prover too weak. 118946 trivial. 0 not checked. [2019-12-07 19:51:34,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2100367243] [2019-12-07 19:51:34,824 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:51:34,824 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:51:34,824 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:51:34,824 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:51:34,824 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:51:34,855 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:51:34,936 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:51:34,940 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:51:35,130 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:51:35,592 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:51:36,128 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:51:36,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:51:36,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23, 23] total 96 [2019-12-07 19:51:36,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186357193] [2019-12-07 19:51:36,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-12-07 19:51:36,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:51:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-12-07 19:51:36,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1512, Invalid=8790, Unknown=0, NotChecked=0, Total=10302 [2019-12-07 19:51:36,131 INFO L87 Difference]: Start difference. First operand 985 states and 1000 transitions. Second operand 96 states. [2019-12-07 19:51:37,431 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-12-07 19:51:37,868 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-07 19:51:39,637 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-07 19:51:39,892 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:40,774 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:51:41,012 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-07 19:51:41,357 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:51:43,054 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:51:43,365 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:43,647 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:51:44,066 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:51:44,337 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-07 19:51:45,836 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:51:46,141 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:51:46,492 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:47,593 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:51:47,916 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:48,210 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:51:48,534 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:53,782 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:51:54,112 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:56,062 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-07 19:51:56,846 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:57,196 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:57,565 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:57,912 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:58,277 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:58,623 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:58,967 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:59,603 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:51:59,995 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:00,473 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:52:00,788 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:52:01,034 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-07 19:52:01,370 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 19:52:01,659 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:52:02,014 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 19:52:03,885 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:06,072 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:06,538 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:07,589 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:07,961 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:08,332 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:08,824 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 19:52:12,216 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 19:52:18,043 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 19:52:18,366 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 19:52:18,711 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 19:52:19,047 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 19:52:20,372 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 19:52:26,412 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 19:52:27,531 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 19:52:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:52:28,382 INFO L93 Difference]: Finished difference Result 1256 states and 1321 transitions. [2019-12-07 19:52:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 466 states. [2019-12-07 19:52:28,382 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 953 [2019-12-07 19:52:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:52:28,388 INFO L225 Difference]: With dead ends: 1256 [2019-12-07 19:52:28,388 INFO L226 Difference]: Without dead ends: 1256 [2019-12-07 19:52:28,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3371 GetRequests, 2808 SyntacticMatches, 0 SemanticMatches, 563 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113381 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=53916, Invalid=264744, Unknown=0, NotChecked=0, Total=318660 [2019-12-07 19:52:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-12-07 19:52:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1020. [2019-12-07 19:52:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-12-07 19:52:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1043 transitions. [2019-12-07 19:52:28,404 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1043 transitions. Word has length 953 [2019-12-07 19:52:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:52:28,405 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1043 transitions. [2019-12-07 19:52:28,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-12-07 19:52:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1043 transitions. [2019-12-07 19:52:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2019-12-07 19:52:28,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:52:28,412 INFO L410 BasicCegarLoop]: trace histogram [308, 308, 307, 23, 22, 22, 1, 1] [2019-12-07 19:52:28,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:52:28,613 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:52:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:52:28,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1392375075, now seen corresponding path program 15 times [2019-12-07 19:52:28,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:52:28,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651707105] [2019-12-07 19:52:28,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:52:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:52:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 149325 backedges. 2071 proven. 140907 refuted. 0 times theorem prover too weak. 6347 trivial. 0 not checked. [2019-12-07 19:52:30,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651707105] [2019-12-07 19:52:30,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207576948] [2019-12-07 19:52:30,617 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:52:35,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:52:35,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:52:35,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 3751 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-07 19:52:35,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:52:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 149325 backedges. 2134 proven. 140844 refuted. 0 times theorem prover too weak. 6347 trivial. 0 not checked. [2019-12-07 19:52:38,020 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:52:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 149325 backedges. 2134 proven. 140844 refuted. 0 times theorem prover too weak. 6347 trivial. 0 not checked. [2019-12-07 19:52:39,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [579370592] [2019-12-07 19:52:39,801 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:52:39,801 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:52:39,802 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:52:39,802 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:52:39,802 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:52:39,831 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:52:39,919 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:52:39,922 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:52:40,122 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:52:40,656 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:52:41,269 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:52:41,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:52:41,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 108 [2019-12-07 19:52:41,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443624837] [2019-12-07 19:52:41,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-12-07 19:52:41,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:52:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-12-07 19:52:41,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=10141, Unknown=0, NotChecked=0, Total=13110 [2019-12-07 19:52:41,272 INFO L87 Difference]: Start difference. First operand 1020 states and 1043 transitions. Second operand 109 states. [2019-12-07 19:53:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:19,914 INFO L93 Difference]: Finished difference Result 1779 states and 1834 transitions. [2019-12-07 19:53:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 586 states. [2019-12-07 19:53:19,914 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 992 [2019-12-07 19:53:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:19,920 INFO L225 Difference]: With dead ends: 1779 [2019-12-07 19:53:19,920 INFO L226 Difference]: Without dead ends: 1779 [2019-12-07 19:53:19,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3614 GetRequests, 2879 SyntacticMatches, 40 SemanticMatches, 695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276704 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=128468, Invalid=356644, Unknown=0, NotChecked=0, Total=485112 [2019-12-07 19:53:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-07 19:53:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1776. [2019-12-07 19:53:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2019-12-07 19:53:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1831 transitions. [2019-12-07 19:53:19,941 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1831 transitions. Word has length 992 [2019-12-07 19:53:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:19,942 INFO L462 AbstractCegarLoop]: Abstraction has 1776 states and 1831 transitions. [2019-12-07 19:53:19,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-12-07 19:53:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1831 transitions. [2019-12-07 19:53:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1641 [2019-12-07 19:53:19,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:19,959 INFO L410 BasicCegarLoop]: trace histogram [515, 515, 514, 32, 31, 31, 1, 1] [2019-12-07 19:53:20,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:53:20,160 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:53:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:20,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1738399412, now seen corresponding path program 16 times [2019-12-07 19:53:20,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:20,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929632981] [2019-12-07 19:53:20,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 414456 backedges. 344610 proven. 27750 refuted. 0 times theorem prover too weak. 42096 trivial. 0 not checked. [2019-12-07 19:53:23,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929632981] [2019-12-07 19:53:23,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216454400] [2019-12-07 19:53:23,404 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:53:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:23,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 6082 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 19:53:23,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:53:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 414456 backedges. 315405 proven. 20560 refuted. 0 times theorem prover too weak. 78491 trivial. 0 not checked. [2019-12-07 19:53:26,229 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:53:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 414456 backedges. 315405 proven. 20560 refuted. 0 times theorem prover too weak. 78491 trivial. 0 not checked. [2019-12-07 19:53:28,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581905863] [2019-12-07 19:53:28,574 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:53:28,574 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:53:28,574 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:53:28,575 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:53:28,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:53:28,615 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:53:28,699 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:53:28,703 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:53:28,893 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:53:29,329 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:53:29,835 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:53:29,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:53:29,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 48, 48] total 83 [2019-12-07 19:53:29,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842422558] [2019-12-07 19:53:29,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-12-07 19:53:29,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:29,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-12-07 19:53:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1473, Invalid=6359, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 19:53:29,839 INFO L87 Difference]: Start difference. First operand 1776 states and 1831 transitions. Second operand 83 states. [2019-12-07 19:54:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:54:12,890 INFO L93 Difference]: Finished difference Result 1776 states and 1797 transitions. [2019-12-07 19:54:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 406 states. [2019-12-07 19:54:12,890 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 1640 [2019-12-07 19:54:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:54:12,895 INFO L225 Difference]: With dead ends: 1776 [2019-12-07 19:54:12,895 INFO L226 Difference]: Without dead ends: 1776 [2019-12-07 19:54:12,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5377 GetRequests, 4843 SyntacticMatches, 44 SemanticMatches, 490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78572 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=65704, Invalid=175868, Unknown=0, NotChecked=0, Total=241572 [2019-12-07 19:54:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2019-12-07 19:54:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2019-12-07 19:54:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2019-12-07 19:54:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1797 transitions. [2019-12-07 19:54:12,910 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1797 transitions. Word has length 1640 [2019-12-07 19:54:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:54:12,910 INFO L462 AbstractCegarLoop]: Abstraction has 1776 states and 1797 transitions. [2019-12-07 19:54:12,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-12-07 19:54:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1797 transitions. [2019-12-07 19:54:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2019-12-07 19:54:12,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:54:12,925 INFO L410 BasicCegarLoop]: trace histogram [545, 545, 544, 32, 31, 31, 1, 1] [2019-12-07 19:54:13,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:54:13,126 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:54:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:54:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -433296304, now seen corresponding path program 17 times [2019-12-07 19:54:13,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:54:13,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459782424] [2019-12-07 19:54:13,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:54:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:54:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 394437 proven. 37650 refuted. 0 times theorem prover too weak. 30954 trivial. 0 not checked. [2019-12-07 19:54:16,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459782424] [2019-12-07 19:54:16,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774710070] [2019-12-07 19:54:16,864 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:54:17,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-12-07 19:54:17,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:54:17,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 19:54:17,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:54:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 40671 proven. 52855 refuted. 0 times theorem prover too weak. 369515 trivial. 0 not checked. [2019-12-07 19:54:24,781 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:54:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 0 proven. 93526 refuted. 0 times theorem prover too weak. 369515 trivial. 0 not checked. [2019-12-07 19:54:35,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854257172] [2019-12-07 19:54:35,198 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:54:35,198 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:54:35,198 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:54:35,198 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:54:35,198 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:54:35,229 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:54:35,312 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:54:35,316 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:54:35,518 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:54:36,005 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:54:36,524 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:54:36,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:54:36,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 34, 34] total 129 [2019-12-07 19:54:36,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197817206] [2019-12-07 19:54:36,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-12-07 19:54:36,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:54:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-12-07 19:54:36,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2866, Invalid=15224, Unknown=0, NotChecked=0, Total=18090 [2019-12-07 19:54:36,528 INFO L87 Difference]: Start difference. First operand 1776 states and 1797 transitions. Second operand 129 states. [2019-12-07 19:54:40,313 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 19:54:40,620 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:54:40,945 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:54:41,266 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-12-07 19:54:41,685 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 19:54:41,926 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-07 19:54:42,233 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-07 19:54:42,936 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:45,399 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:45,771 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:54:46,852 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-07 19:54:47,205 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:47,568 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:47,944 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:54:48,309 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:48,676 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:49,055 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:54:49,365 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 19:54:49,705 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:54:50,107 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:54:50,521 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-12-07 19:54:51,047 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 19:54:51,324 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-07 19:54:51,683 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-07 19:54:52,077 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-07 19:54:52,494 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:52,866 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:53,230 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:53,609 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:53,989 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:54,377 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:54,960 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:54:55,291 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:54:58,075 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:58,472 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:58,903 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:59,286 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:54:59,909 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:00,266 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 19:55:00,649 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:55:01,037 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:55:01,422 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-12-07 19:55:02,362 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:02,715 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:03,062 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:03,411 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:03,795 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:55:04,183 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:04,540 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:05,776 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-12-07 19:55:06,087 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-07 19:55:06,445 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-07 19:55:07,712 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:08,114 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:08,517 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:08,927 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:55:10,552 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 19:55:12,356 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:55:12,743 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:13,118 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:15,250 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-07 19:55:15,633 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-07 19:55:16,036 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:16,637 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:17,728 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:55:18,156 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:18,959 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:55:20,213 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:24,449 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:25,528 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:26,244 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:26,674 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:27,602 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:55:28,098 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 19:55:28,509 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-12-07 19:55:28,964 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 19:55:29,236 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-12-07 19:55:29,529 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-07 19:55:29,913 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-07 19:55:30,310 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:30,677 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:31,013 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:31,357 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:32,507 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:33,619 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:35,367 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:35,729 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:36,117 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:41,097 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 19:55:41,577 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 19:55:42,076 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 19:55:42,958 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 19:55:43,422 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 19:56:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:03,125 INFO L93 Difference]: Finished difference Result 1891 states and 1911 transitions. [2019-12-07 19:56:03,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 596 states. [2019-12-07 19:56:03,126 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 1730 [2019-12-07 19:56:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:03,131 INFO L225 Difference]: With dead ends: 1891 [2019-12-07 19:56:03,131 INFO L226 Difference]: Without dead ends: 1891 [2019-12-07 19:56:03,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5843 GetRequests, 5117 SyntacticMatches, 0 SemanticMatches, 726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179557 ImplicationChecksByTransitivity, 83.7s TimeCoverageRelationStatistics Valid=91701, Invalid=437555, Unknown=0, NotChecked=0, Total=529256 [2019-12-07 19:56:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2019-12-07 19:56:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1875. [2019-12-07 19:56:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-12-07 19:56:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1895 transitions. [2019-12-07 19:56:03,150 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1895 transitions. Word has length 1730 [2019-12-07 19:56:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:03,151 INFO L462 AbstractCegarLoop]: Abstraction has 1875 states and 1895 transitions. [2019-12-07 19:56:03,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-12-07 19:56:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1895 transitions. [2019-12-07 19:56:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2019-12-07 19:56:03,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:03,166 INFO L410 BasicCegarLoop]: trace histogram [554, 554, 553, 32, 31, 31, 1, 1] [2019-12-07 19:56:03,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:56:03,367 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:56:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1102591621, now seen corresponding path program 18 times [2019-12-07 19:56:03,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:03,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349161072] [2019-12-07 19:56:03,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 405573 proven. 39056 refuted. 0 times theorem prover too weak. 33514 trivial. 0 not checked. [2019-12-07 19:56:07,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349161072] [2019-12-07 19:56:07,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418553907] [2019-12-07 19:56:07,169 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:56:15,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:56:15,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:56:15,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 6472 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 19:56:15,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 408248 proven. 36370 refuted. 0 times theorem prover too weak. 33525 trivial. 0 not checked. [2019-12-07 19:56:18,245 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:56:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 408248 proven. 36370 refuted. 0 times theorem prover too weak. 33525 trivial. 0 not checked. [2019-12-07 19:56:21,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108664237] [2019-12-07 19:56:21,181 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:56:21,181 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:56:21,181 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:56:21,182 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:56:21,182 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:56:21,211 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:21,301 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:21,306 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:21,494 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:56:21,693 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-07 19:56:22,489 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:56:23,096 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:56:23,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:56:23,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 58, 58] total 93 [2019-12-07 19:56:23,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771014558] [2019-12-07 19:56:23,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-12-07 19:56:23,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-12-07 19:56:23,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1900, Invalid=7802, Unknown=0, NotChecked=0, Total=9702 [2019-12-07 19:56:23,100 INFO L87 Difference]: Start difference. First operand 1875 states and 1895 transitions. Second operand 93 states. [2019-12-07 19:57:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:11,719 INFO L93 Difference]: Finished difference Result 1875 states and 1889 transitions. [2019-12-07 19:57:11,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 466 states. [2019-12-07 19:57:11,719 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1757 [2019-12-07 19:57:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:11,725 INFO L225 Difference]: With dead ends: 1875 [2019-12-07 19:57:11,725 INFO L226 Difference]: Without dead ends: 1875 [2019-12-07 19:57:11,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5795 GetRequests, 5180 SyntacticMatches, 55 SemanticMatches, 560 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106149 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=84689, Invalid=230593, Unknown=0, NotChecked=0, Total=315282 [2019-12-07 19:57:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-12-07 19:57:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2019-12-07 19:57:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-12-07 19:57:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1889 transitions. [2019-12-07 19:57:11,742 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1889 transitions. Word has length 1757 [2019-12-07 19:57:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:11,743 INFO L462 AbstractCegarLoop]: Abstraction has 1875 states and 1889 transitions. [2019-12-07 19:57:11,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-12-07 19:57:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1889 transitions. [2019-12-07 19:57:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2019-12-07 19:57:11,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:11,757 INFO L410 BasicCegarLoop]: trace histogram [557, 557, 556, 32, 31, 31, 1, 1] [2019-12-07 19:57:11,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:11,958 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:57:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash -551396264, now seen corresponding path program 19 times [2019-12-07 19:57:11,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:11,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128959703] [2019-12-07 19:57:11,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 483231 backedges. 417122 proven. 45952 refuted. 0 times theorem prover too weak. 20157 trivial. 0 not checked. [2019-12-07 19:57:16,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128959703] [2019-12-07 19:57:16,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089758789] [2019-12-07 19:57:16,105 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:16,654 INFO L264 TraceCheckSpWp]: Trace formula consists of 6502 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 19:57:16,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 483231 backedges. 417030 proven. 40279 refuted. 0 times theorem prover too weak. 25922 trivial. 0 not checked. [2019-12-07 19:57:19,705 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 483231 backedges. 417030 proven. 40279 refuted. 0 times theorem prover too weak. 25922 trivial. 0 not checked. [2019-12-07 19:57:22,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [284338825] [2019-12-07 19:57:22,942 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 19:57:22,942 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:22,942 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:22,942 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:22,942 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:22,970 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:23,055 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:23,058 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:23,258 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:23,696 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 19:57:24,204 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:24,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:24,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 60, 60] total 97 [2019-12-07 19:57:24,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855301291] [2019-12-07 19:57:24,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-12-07 19:57:24,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-12-07 19:57:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=8451, Unknown=0, NotChecked=0, Total=10506 [2019-12-07 19:57:24,208 INFO L87 Difference]: Start difference. First operand 1875 states and 1889 transitions. Second operand 97 states. [2019-12-07 19:58:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:07,232 INFO L93 Difference]: Finished difference Result 1875 states and 1880 transitions. [2019-12-07 19:58:07,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 528 states. [2019-12-07 19:58:07,233 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1766 [2019-12-07 19:58:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:07,254 INFO L225 Difference]: With dead ends: 1875 [2019-12-07 19:58:07,254 INFO L226 Difference]: Without dead ends: 1875 [2019-12-07 19:58:07,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5887 GetRequests, 5203 SyntacticMatches, 58 SemanticMatches, 626 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134231 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=108130, Invalid=285626, Unknown=0, NotChecked=0, Total=393756 [2019-12-07 19:58:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-12-07 19:58:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2019-12-07 19:58:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-12-07 19:58:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1880 transitions. [2019-12-07 19:58:07,279 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1880 transitions. Word has length 1766 [2019-12-07 19:58:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:07,280 INFO L462 AbstractCegarLoop]: Abstraction has 1875 states and 1880 transitions. [2019-12-07 19:58:07,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-12-07 19:58:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1880 transitions. [2019-12-07 19:58:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1776 [2019-12-07 19:58:07,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:07,295 INFO L410 BasicCegarLoop]: trace histogram [560, 560, 559, 32, 31, 31, 1, 1] [2019-12-07 19:58:07,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:07,496 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 19:58:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 784755803, now seen corresponding path program 20 times [2019-12-07 19:58:07,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:58:07,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578045532] [2019-12-07 19:58:07,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:58:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:58:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:58:12,039 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:58:12,039 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:58:12,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:58:12 BoogieIcfgContainer [2019-12-07 19:58:12,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:58:12,358 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:58:12,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:58:12,358 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:58:12,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:48:29" (3/4) ... [2019-12-07 19:58:12,360 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:58:12,578 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5f66ac8f-a159-454b-8e61-c8551d012744/bin/utaipan/witness.graphml [2019-12-07 19:58:12,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:58:12,579 INFO L168 Benchmark]: Toolchain (without parser) took 583293.55 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 947.8 MB in the beginning and 442.1 MB in the end (delta: 505.7 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 19:58:12,579 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:58:12,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:12,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:58:12,579 INFO L168 Benchmark]: Boogie Preprocessor took 15.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:12,579 INFO L168 Benchmark]: RCFGBuilder took 248.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:12,579 INFO L168 Benchmark]: TraceAbstraction took 582607.60 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 559.7 MB in the end (delta: 504.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 19:58:12,579 INFO L168 Benchmark]: Witness Printer took 220.02 ms. Allocated memory is still 3.4 GB. Free memory was 559.7 MB in the beginning and 442.1 MB in the end (delta: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:12,580 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 248.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 582607.60 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 559.7 MB in the end (delta: 504.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 220.02 ms. Allocated memory is still 3.4 GB. Free memory was 559.7 MB in the beginning and 442.1 MB in the end (delta: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L24] int i, b[32]; [L25] char mask[32]; [L26] i = 0 [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] a[i] [L18] b[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. Result: UNSAFE, OverallTime: 582.2s, OverallIterations: 32, TraceHistogramMax: 560, AutomataDifference: 441.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 11305 SDslu, 335 SDs, 0 SdLazy, 54080 SolverSat, 8750 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43373 GetRequests, 37051 SyntacticMatches, 308 SemanticMatches, 6014 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112672 ImplicationChecksByTransitivity, 430.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3235occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 1380 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 20.9s SatisfiabilityAnalysisTime, 66.4s InterpolantComputationTime, 27185 NumberOfCodeBlocks, 24359 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 38018 ConstructedInterpolants, 21 QuantifiedInterpolants, 215555814 SizeOfPredicates, 118 NumberOfNonLiveVariables, 37932 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 81 InterpolantComputations, 6 PerfectInterpolantSequences, 6179544/7359803 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 838, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 16, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 47, TOOLS_POST_TIME[ms]: 344, 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: 45, TOOLS_QUANTIFIERELIM_TIME[ms]: 332, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 64, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 84, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME[ms]: 183, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME[ms]: 232, DOMAIN_ISSUBSETEQ_APPLICATIONS: 7, DOMAIN_ISSUBSETEQ_TIME[ms]: 17, DOMAIN_ISBOTTOM_APPLICATIONS: 16, DOMAIN_ISBOTTOM_TIME[ms]: 22, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 644, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 644, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 7, 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]: 2, DAG_COMPRESSION_TIME[ms]: 8, DAG_COMPRESSION_PROCESSED_NODES: 111, DAG_COMPRESSION_RETAINED_NODES: 51, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...