./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56b28f59847d63942ec468b0c95f39e5b8c0763a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:21:08,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:21:08,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:21:08,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:21:08,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:21:08,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:21:08,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:21:08,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:21:08,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:21:08,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:21:08,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:21:08,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:21:08,478 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:21:08,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:21:08,480 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:21:08,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:21:08,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:21:08,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:21:08,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:21:08,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:21:08,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:21:08,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:21:08,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:21:08,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:21:08,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:21:08,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:21:08,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:21:08,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:21:08,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:21:08,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:21:08,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:21:08,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:21:08,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:21:08,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:21:08,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:21:08,493 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:21:08,493 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:21:08,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:21:08,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:21:08,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:21:08,504 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:21:08,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:21:08,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:21:08,505 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:21:08,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:21:08,505 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:21:08,505 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:21:08,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:21:08,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:21:08,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:21:08,505 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:21:08,506 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:21:08,506 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:21:08,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:21:08,506 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:21:08,506 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:21:08,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:21:08,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:21:08,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:21:08,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:21:08,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:21:08,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:21:08,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:21:08,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:21:08,507 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:21:08,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2018-11-28 13:21:08,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:21:08,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:21:08,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:21:08,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:21:08,541 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:21:08,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-28 13:21:08,584 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/data/ec60565b6/67c9f651f4b942c58f89f5bb466f56ed/FLAG9949ba80b [2018-11-28 13:21:08,988 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:21:08,988 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-28 13:21:08,992 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/data/ec60565b6/67c9f651f4b942c58f89f5bb466f56ed/FLAG9949ba80b [2018-11-28 13:21:09,001 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/data/ec60565b6/67c9f651f4b942c58f89f5bb466f56ed [2018-11-28 13:21:09,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:21:09,004 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:21:09,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:21:09,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:21:09,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:21:09,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594db415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09, skipping insertion in model container [2018-11-28 13:21:09,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:21:09,027 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:21:09,116 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:21:09,122 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:21:09,132 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:21:09,141 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:21:09,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09 WrapperNode [2018-11-28 13:21:09,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:21:09,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:21:09,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:21:09,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:21:09,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... [2018-11-28 13:21:09,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:21:09,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:21:09,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:21:09,169 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:21:09,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:21:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:21:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:21:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-28 13:21:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:21:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-28 13:21:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:21:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:21:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:21:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:21:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:21:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:21:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:21:09,427 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:21:09,427 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 13:21:09,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:09 BoogieIcfgContainer [2018-11-28 13:21:09,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:21:09,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:21:09,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:21:09,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:21:09,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:21:09" (1/3) ... [2018-11-28 13:21:09,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e403cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:21:09, skipping insertion in model container [2018-11-28 13:21:09,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:09" (2/3) ... [2018-11-28 13:21:09,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e403cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:21:09, skipping insertion in model container [2018-11-28 13:21:09,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:09" (3/3) ... [2018-11-28 13:21:09,433 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-28 13:21:09,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:21:09,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-28 13:21:09,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-28 13:21:09,485 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:21:09,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:21:09,486 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:21:09,486 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:21:09,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:21:09,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:21:09,487 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:21:09,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:21:09,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:21:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-28 13:21:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:21:09,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:09,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:09,510 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-11-28 13:21:09,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:09,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:09,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:09,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:09,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:09,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:21:09,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:09,635 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-28 13:21:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:09,690 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-28 13:21:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:09,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:21:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:09,697 INFO L225 Difference]: With dead ends: 58 [2018-11-28 13:21:09,697 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 13:21:09,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 13:21:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-28 13:21:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 13:21:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 13:21:09,723 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-11-28 13:21:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:09,724 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 13:21:09,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 13:21:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:21:09,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:09,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:09,725 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:09,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:09,725 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-11-28 13:21:09,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:09,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:09,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:09,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:09,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:09,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:09,772 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-11-28 13:21:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:09,793 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-28 13:21:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:09,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 13:21:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:09,796 INFO L225 Difference]: With dead ends: 49 [2018-11-28 13:21:09,796 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 13:21:09,796 INFO L631 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 [2018-11-28 13:21:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 13:21:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-11-28 13:21:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 13:21:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 13:21:09,801 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2018-11-28 13:21:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:09,801 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 13:21:09,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 13:21:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 13:21:09,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:09,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:09,802 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:09,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2018-11-28 13:21:09,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:09,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:09,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:09,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:09,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:09,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:09,872 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-11-28 13:21:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:09,940 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 13:21:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:09,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-28 13:21:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:09,941 INFO L225 Difference]: With dead ends: 40 [2018-11-28 13:21:09,942 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 13:21:09,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:21:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 13:21:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 13:21:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 13:21:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 13:21:09,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2018-11-28 13:21:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:09,946 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 13:21:09,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-28 13:21:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 13:21:09,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:09,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:09,947 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:09,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2018-11-28 13:21:09,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:09,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:10,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:10,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:21:10,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:21:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:21:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:21:10,034 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-28 13:21:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:10,106 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-28 13:21:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:21:10,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-28 13:21:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:10,107 INFO L225 Difference]: With dead ends: 42 [2018-11-28 13:21:10,107 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 13:21:10,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:21:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 13:21:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-28 13:21:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 13:21:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 13:21:10,111 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2018-11-28 13:21:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:10,111 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 13:21:10,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:21:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 13:21:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:21:10,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:10,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:10,112 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:10,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-11-28 13:21:10,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:10,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:10,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:10,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:21:10,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:21:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:21:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:21:10,172 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2018-11-28 13:21:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:10,262 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-28 13:21:10,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:10,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 13:21:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:10,263 INFO L225 Difference]: With dead ends: 60 [2018-11-28 13:21:10,263 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 13:21:10,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 13:21:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2018-11-28 13:21:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:21:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-28 13:21:10,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2018-11-28 13:21:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:10,270 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-28 13:21:10,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:21:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-28 13:21:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:21:10,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:10,271 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:10,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:10,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2018-11-28 13:21:10,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:10,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:10,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:10,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:10,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:21:10,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:21:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:21:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:10,319 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-11-28 13:21:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:10,383 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-28 13:21:10,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:21:10,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 13:21:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:10,385 INFO L225 Difference]: With dead ends: 70 [2018-11-28 13:21:10,385 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 13:21:10,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:21:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 13:21:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-11-28 13:21:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 13:21:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-28 13:21:10,390 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-11-28 13:21:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:10,391 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-28 13:21:10,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:21:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-28 13:21:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 13:21:10,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:10,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:10,392 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:10,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2018-11-28 13:21:10,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:10,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:10,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:21:10,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:10,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:10,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:10,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:10,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:10,434 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-11-28 13:21:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:10,454 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-28 13:21:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:10,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 13:21:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:10,455 INFO L225 Difference]: With dead ends: 48 [2018-11-28 13:21:10,455 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 13:21:10,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 13:21:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 13:21:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 13:21:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-28 13:21:10,459 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 20 [2018-11-28 13:21:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:10,460 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-28 13:21:10,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-28 13:21:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 13:21:10,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:10,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:10,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:10,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:10,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234190, now seen corresponding path program 1 times [2018-11-28 13:21:10,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:10,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:21:10,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:10,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:10,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:10,507 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2018-11-28 13:21:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:10,529 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-28 13:21:10,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:10,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 13:21:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:10,530 INFO L225 Difference]: With dead ends: 52 [2018-11-28 13:21:10,530 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 13:21:10,530 INFO L631 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 [2018-11-28 13:21:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 13:21:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-28 13:21:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 13:21:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-28 13:21:10,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 20 [2018-11-28 13:21:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:10,534 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-28 13:21:10,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-28 13:21:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 13:21:10,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:10,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:10,535 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:10,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2011781567, now seen corresponding path program 1 times [2018-11-28 13:21:10,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:21:10,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:10,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:21:10,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:10,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 13:21:10,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:10,622 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-11-28 13:21:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:10,658 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-28 13:21:10,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:21:10,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-28 13:21:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:10,660 INFO L225 Difference]: With dead ends: 74 [2018-11-28 13:21:10,660 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 13:21:10,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 13:21:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-11-28 13:21:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 13:21:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-11-28 13:21:10,665 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 26 [2018-11-28 13:21:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:10,665 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-28 13:21:10,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-28 13:21:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:21:10,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:10,666 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:10,666 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:10,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1143280978, now seen corresponding path program 1 times [2018-11-28 13:21:10,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:10,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:21:10,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:10,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:10,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:21:10,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:21:10,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 13:21:10,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:21:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:21:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:21:10,809 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2018-11-28 13:21:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:10,909 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-28 13:21:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:21:10,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-28 13:21:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:10,910 INFO L225 Difference]: With dead ends: 67 [2018-11-28 13:21:10,910 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 13:21:10,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:21:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 13:21:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-11-28 13:21:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 13:21:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-28 13:21:10,914 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-11-28 13:21:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:10,914 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-28 13:21:10,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:21:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-28 13:21:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:21:10,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:10,915 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:10,916 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:10,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1735380924, now seen corresponding path program 1 times [2018-11-28 13:21:10,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:21:10,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:10,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:10,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:11,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 13:21:11,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:11,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-11-28 13:21:11,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:21:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:21:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:21:11,059 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 10 states. [2018-11-28 13:21:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:11,176 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-28 13:21:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:21:11,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-28 13:21:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:11,177 INFO L225 Difference]: With dead ends: 73 [2018-11-28 13:21:11,177 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 13:21:11,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:21:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 13:21:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-11-28 13:21:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 13:21:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-28 13:21:11,180 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 32 [2018-11-28 13:21:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:11,180 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-28 13:21:11,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:21:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-28 13:21:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 13:21:11,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:11,181 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:11,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:11,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1978883467, now seen corresponding path program 2 times [2018-11-28 13:21:11,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:11,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:21:11,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:11,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:11,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:21:11,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:21:11,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:21:11,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:21:11,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:11,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 13:21:11,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:21:11,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:21:11,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:21:11,334 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 10 states. [2018-11-28 13:21:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:11,454 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-28 13:21:11,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:21:11,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-28 13:21:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:11,456 INFO L225 Difference]: With dead ends: 71 [2018-11-28 13:21:11,456 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 13:21:11,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:21:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 13:21:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-11-28 13:21:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 13:21:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-28 13:21:11,460 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 36 [2018-11-28 13:21:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:11,460 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-28 13:21:11,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:21:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-28 13:21:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 13:21:11,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:11,461 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:11,461 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:11,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:11,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1930842354, now seen corresponding path program 3 times [2018-11-28 13:21:11,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:11,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:11,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:21:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 13:21:11,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:11,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:11,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:21:11,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 13:21:11,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:21:11,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:11,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:21:11,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:11,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:21:11,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:11,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 13:21:11,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:11,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:11,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:11,611 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-11-28 13:21:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 13:21:11,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:11,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-28 13:21:11,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:21:11,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:21:11,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:21:11,748 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2018-11-28 13:21:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:11,840 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-11-28 13:21:11,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:21:11,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-28 13:21:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:11,841 INFO L225 Difference]: With dead ends: 65 [2018-11-28 13:21:11,841 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 13:21:11,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:21:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 13:21:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-28 13:21:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 13:21:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-11-28 13:21:11,844 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2018-11-28 13:21:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:11,845 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-28 13:21:11,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:21:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-11-28 13:21:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:21:11,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:11,846 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:11,846 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:11,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash 492189859, now seen corresponding path program 2 times [2018-11-28 13:21:11,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:11,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:11,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:21:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 13:21:11,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:11,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:11,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:21:11,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 13:21:11,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:21:11,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:11,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:21:11,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:11,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:21:11,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:11,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 13:21:11,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:11,960 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:11,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:11,964 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2018-11-28 13:21:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-28 13:21:12,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:21:12,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-11-28 13:21:12,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:21:12,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:21:12,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:21:12,060 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2018-11-28 13:21:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:12,189 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-11-28 13:21:12,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:21:12,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-28 13:21:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:12,190 INFO L225 Difference]: With dead ends: 87 [2018-11-28 13:21:12,190 INFO L226 Difference]: Without dead ends: 87 [2018-11-28 13:21:12,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:21:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-28 13:21:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-11-28 13:21:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 13:21:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-28 13:21:12,193 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 47 [2018-11-28 13:21:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:12,194 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-28 13:21:12,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:21:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-28 13:21:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:21:12,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:12,195 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:12,195 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:12,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash -918660315, now seen corresponding path program 1 times [2018-11-28 13:21:12,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:12,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:12,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:12,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:21:12,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-11-28 13:21:12,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:12,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:12,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:12,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 156 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 13:21:12,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:12,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-11-28 13:21:12,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:21:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:21:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:21:12,398 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 14 states. [2018-11-28 13:21:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:12,564 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-11-28 13:21:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:21:12,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2018-11-28 13:21:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:12,565 INFO L225 Difference]: With dead ends: 147 [2018-11-28 13:21:12,565 INFO L226 Difference]: Without dead ends: 147 [2018-11-28 13:21:12,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:21:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-28 13:21:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2018-11-28 13:21:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 13:21:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-11-28 13:21:12,571 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 92 [2018-11-28 13:21:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:12,571 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-11-28 13:21:12,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:21:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-11-28 13:21:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-28 13:21:12,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:12,573 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:12,573 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 13:21:12,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1779963986, now seen corresponding path program 2 times [2018-11-28 13:21:12,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:12,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-11-28 13:21:12,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:12,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:21:12,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:21:12,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 13:21:12,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:21:12,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:12,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:12,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 13:21:12,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 13:21:12,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:12,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 13:21:12,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:12,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 13:21:12,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 13:21:12,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:12,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 13:21:12,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:12,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 13:21:12,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 13:21:12,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:12,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 13:21:12,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:12,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 13:21:12,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 13:21:12,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:12,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:12,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 13:21:13,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:13,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 13:21:13,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 13:21:13,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:13,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:13,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:13,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 13:21:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2018-11-28 13:21:13,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:21:13,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-11-28 13:21:13,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:21:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:21:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2018-11-28 13:21:13,792 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 12 states. [2018-11-28 13:21:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:14,064 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-11-28 13:21:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 13:21:14,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2018-11-28 13:21:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:14,065 INFO L225 Difference]: With dead ends: 137 [2018-11-28 13:21:14,065 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:21:14,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2018-11-28 13:21:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:21:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:21:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:21:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:21:14,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2018-11-28 13:21:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:14,066 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:21:14,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:21:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:21:14,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:21:14,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:21:14 BoogieIcfgContainer [2018-11-28 13:21:14,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:21:14,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:21:14,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:21:14,071 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:21:14,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:09" (3/4) ... [2018-11-28 13:21:14,074 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:21:14,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:21:14,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-28 13:21:14,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:21:14,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-28 13:21:14,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 13:21:14,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 13:21:14,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:21:14,115 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d52424ec-2291-470e-b261-4df98b07191a/bin-2019/uautomizer/witness.graphml [2018-11-28 13:21:14,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:21:14,116 INFO L168 Benchmark]: Toolchain (without parser) took 5112.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 958.0 MB in the beginning and 1.2 GB in the end (delta: -270.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:21:14,117 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:21:14,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:14,117 INFO L168 Benchmark]: Boogie Preprocessor took 26.57 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:14,118 INFO L168 Benchmark]: RCFGBuilder took 258.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:14,118 INFO L168 Benchmark]: TraceAbstraction took 4642.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.5 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:14,118 INFO L168 Benchmark]: Witness Printer took 44.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:14,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.57 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4642.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.5 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Witness Printer took 44.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 4.5s OverallTime, 16 OverallIterations, 12 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 408 SDtfs, 883 SDslu, 1036 SDs, 0 SdLazy, 1509 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 413 SyntacticMatches, 16 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 162 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 982 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 958 ConstructedInterpolants, 162 QuantifiedInterpolants, 414960 SizeOfPredicates, 12 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 1493/1640 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...