./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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 b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:32:59,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:32:59,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:32:59,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:32:59,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:32:59,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:32:59,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:32:59,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:32:59,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:32:59,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:32:59,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:32:59,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:32:59,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:32:59,965 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:32:59,966 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:32:59,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:32:59,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:32:59,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:32:59,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:32:59,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:32:59,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:32:59,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:32:59,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:32:59,973 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:32:59,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:32:59,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:32:59,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:32:59,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:32:59,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:32:59,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:32:59,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:32:59,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:32:59,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:32:59,977 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:32:59,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:32:59,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:32:59,979 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-09 23:32:59,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:32:59,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:32:59,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:32:59,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:32:59,989 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:32:59,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:32:59,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 23:32:59,989 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:32:59,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:32:59,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 23:32:59,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:32:59,990 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-09 23:32:59,990 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-09 23:32:59,990 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-09 23:32:59,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 23:32:59,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 23:32:59,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:32:59,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:32:59,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 23:32:59,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 23:32:59,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 23:32:59,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:32:59,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 23:32:59,991 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:32:59,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 23:32:59,991 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_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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 -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2018-11-09 23:33:00,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:33:00,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:33:00,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:33:00,025 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:33:00,025 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:33:00,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-09 23:33:00,060 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/data/9ccd8dc5c/0e3f0c2c6d1a4ea592f45eb1df197e3c/FLAG46f8f162e [2018-11-09 23:33:00,463 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:33:00,463 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-09 23:33:00,467 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/data/9ccd8dc5c/0e3f0c2c6d1a4ea592f45eb1df197e3c/FLAG46f8f162e [2018-11-09 23:33:00,475 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/data/9ccd8dc5c/0e3f0c2c6d1a4ea592f45eb1df197e3c [2018-11-09 23:33:00,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:33:00,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 23:33:00,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:33:00,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:33:00,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:33:00,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00, skipping insertion in model container [2018-11-09 23:33:00,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:33:00,510 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:33:00,627 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:33:00,638 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:33:00,651 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:33:00,666 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:33:00,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00 WrapperNode [2018-11-09 23:33:00,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:33:00,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:33:00,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:33:00,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:33:00,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... [2018-11-09 23:33:00,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:33:00,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:33:00,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:33:00,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:33:00,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 23:33:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:33:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-09 23:33:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-09 23:33:00,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-11-09 23:33:00,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-11-09 23:33:00,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 23:33:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-09 23:33:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-09 23:33:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 23:33:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-09 23:33:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 23:33:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-11-09 23:33:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-11-09 23:33:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 23:33:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-09 23:33:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 23:33:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-09 23:33:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:33:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-09 23:33:01,066 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:33:01,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:33:01 BoogieIcfgContainer [2018-11-09 23:33:01,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:33:01,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 23:33:01,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 23:33:01,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 23:33:01,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:33:00" (1/3) ... [2018-11-09 23:33:01,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f17167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:33:01, skipping insertion in model container [2018-11-09 23:33:01,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:00" (2/3) ... [2018-11-09 23:33:01,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f17167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:33:01, skipping insertion in model container [2018-11-09 23:33:01,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:33:01" (3/3) ... [2018-11-09 23:33:01,071 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-11-09 23:33:01,077 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 23:33:01,082 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-09 23:33:01,090 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-09 23:33:01,106 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:33:01,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 23:33:01,106 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-09 23:33:01,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 23:33:01,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:33:01,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:33:01,107 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 23:33:01,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:33:01,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 23:33:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-11-09 23:33:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-09 23:33:01,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:01,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:33:01,129 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:01,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1780687601, now seen corresponding path program 1 times [2018-11-09 23:33:01,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:01,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:01,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:01,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:01,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:01,387 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-09 23:33:01,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:33:01,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:33:01,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-09 23:33:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:33:01,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:33:01,405 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 4 states. [2018-11-09 23:33:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:01,491 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-11-09 23:33:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:33:01,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-09 23:33:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:01,501 INFO L225 Difference]: With dead ends: 119 [2018-11-09 23:33:01,501 INFO L226 Difference]: Without dead ends: 114 [2018-11-09 23:33:01,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:33:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-09 23:33:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-09 23:33:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-09 23:33:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-11-09 23:33:01,530 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 59 [2018-11-09 23:33:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:01,530 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-11-09 23:33:01,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-09 23:33:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-11-09 23:33:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-09 23:33:01,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:01,531 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:33:01,532 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:01,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1780687600, now seen corresponding path program 1 times [2018-11-09 23:33:01,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:01,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:01,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:01,709 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-09 23:33:01,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:33:01,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:33:01,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 23:33:01,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:33:01,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:33:01,712 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 6 states. [2018-11-09 23:33:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:01,844 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-11-09 23:33:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 23:33:01,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-09 23:33:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:01,846 INFO L225 Difference]: With dead ends: 118 [2018-11-09 23:33:01,846 INFO L226 Difference]: Without dead ends: 118 [2018-11-09 23:33:01,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-09 23:33:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-09 23:33:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-09 23:33:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-09 23:33:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-09 23:33:01,855 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 59 [2018-11-09 23:33:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:01,856 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-09 23:33:01,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 23:33:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-09 23:33:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-09 23:33:01,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:01,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:01,857 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:01,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1933054119, now seen corresponding path program 1 times [2018-11-09 23:33:01,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:02,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:02,079 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:02,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:02,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:02,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:02,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:02,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-09 23:33:02,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 15 [2018-11-09 23:33:02,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,224 INFO L477 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 17 treesize of output 21 [2018-11-09 23:33:02,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,235 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-09 23:33:02,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-11-09 23:33:02,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-09 23:33:02,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:02,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 23:33:02,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:02,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:31 [2018-11-09 23:33:02,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-09 23:33:02,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:02,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:02,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2018-11-09 23:33:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:02,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:02,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-09 23:33:02,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-09 23:33:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-09 23:33:02,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=95, Unknown=1, NotChecked=0, Total=132 [2018-11-09 23:33:02,530 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 12 states. [2018-11-09 23:33:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:02,872 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-11-09 23:33:02,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-09 23:33:02,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-09 23:33:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:02,874 INFO L225 Difference]: With dead ends: 122 [2018-11-09 23:33:02,874 INFO L226 Difference]: Without dead ends: 122 [2018-11-09 23:33:02,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=164, Unknown=1, NotChecked=0, Total=240 [2018-11-09 23:33:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-09 23:33:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-11-09 23:33:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-09 23:33:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-11-09 23:33:02,881 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 63 [2018-11-09 23:33:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:02,881 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-11-09 23:33:02,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-09 23:33:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-09 23:33:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-09 23:33:02,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:02,883 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:02,883 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:02,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash 34709694, now seen corresponding path program 2 times [2018-11-09 23:33:02,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:02,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:03,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:03,019 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:03,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:04,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-09 23:33:04,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:04,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:04,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:04,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:04,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-09 23:33:04,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,820 INFO L477 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 17 treesize of output 21 [2018-11-09 23:33:04,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 15 [2018-11-09 23:33:04,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,834 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-09 23:33:04,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-11-09 23:33:04,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-09 23:33:04,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-09 23:33:04,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:04,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2018-11-09 23:33:04,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-11-09 23:33:04,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:04,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-09 23:33:04,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:04,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:04,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:48 [2018-11-09 23:33:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:05,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:05,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2018-11-09 23:33:05,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-09 23:33:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-09 23:33:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-09 23:33:05,198 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 17 states. [2018-11-09 23:33:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:05,778 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-09 23:33:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-09 23:33:05,778 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-09 23:33:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:05,779 INFO L225 Difference]: With dead ends: 127 [2018-11-09 23:33:05,779 INFO L226 Difference]: Without dead ends: 127 [2018-11-09 23:33:05,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2018-11-09 23:33:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-09 23:33:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-09 23:33:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-09 23:33:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-09 23:33:05,783 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 67 [2018-11-09 23:33:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:05,784 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-09 23:33:05,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-09 23:33:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-09 23:33:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-09 23:33:05,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:05,784 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:05,785 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:05,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1706692322, now seen corresponding path program 1 times [2018-11-09 23:33:05,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:05,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:05,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-09 23:33:05,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:33:05,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:33:05,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 23:33:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:33:05,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:33:05,858 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 6 states. [2018-11-09 23:33:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:05,954 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-09 23:33:05,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:33:05,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-09 23:33:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:05,956 INFO L225 Difference]: With dead ends: 126 [2018-11-09 23:33:05,956 INFO L226 Difference]: Without dead ends: 126 [2018-11-09 23:33:05,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:33:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-09 23:33:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-09 23:33:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-09 23:33:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-11-09 23:33:05,961 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 81 [2018-11-09 23:33:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:05,962 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-11-09 23:33:05,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 23:33:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-09 23:33:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-09 23:33:05,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:05,963 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:05,963 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:05,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:05,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1706692323, now seen corresponding path program 1 times [2018-11-09 23:33:05,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:05,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:06,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:06,035 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:06,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:06,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:06,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:06,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-09 23:33:06,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-09 23:33:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-09 23:33:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-09 23:33:06,135 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 8 states. [2018-11-09 23:33:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:06,197 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-09 23:33:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-09 23:33:06,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-11-09 23:33:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:06,198 INFO L225 Difference]: With dead ends: 132 [2018-11-09 23:33:06,198 INFO L226 Difference]: Without dead ends: 132 [2018-11-09 23:33:06,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-09 23:33:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-09 23:33:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-09 23:33:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-09 23:33:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-11-09 23:33:06,203 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 81 [2018-11-09 23:33:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:06,204 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-11-09 23:33:06,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-09 23:33:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-09 23:33:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-09 23:33:06,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:06,206 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:06,206 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:06,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1583454406, now seen corresponding path program 2 times [2018-11-09 23:33:06,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:06,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:06,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:06,271 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:06,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:06,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:06,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:06,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:06,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:06,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:06,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-09 23:33:06,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 15 [2018-11-09 23:33:06,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,369 INFO L477 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 17 treesize of output 21 [2018-11-09 23:33:06,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,390 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-09 23:33:06,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-11-09 23:33:06,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-09 23:33:06,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:06,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 23:33:06,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:06,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:31 [2018-11-09 23:33:06,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-09 23:33:06,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:06,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:06,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2018-11-09 23:33:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-09 23:33:06,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:06,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2018-11-09 23:33:06,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-09 23:33:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-09 23:33:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=164, Unknown=1, NotChecked=0, Total=210 [2018-11-09 23:33:06,625 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 15 states. [2018-11-09 23:33:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:07,128 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-09 23:33:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-09 23:33:07,129 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2018-11-09 23:33:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:07,130 INFO L225 Difference]: With dead ends: 137 [2018-11-09 23:33:07,131 INFO L226 Difference]: Without dead ends: 137 [2018-11-09 23:33:07,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=497, Unknown=1, NotChecked=0, Total=650 [2018-11-09 23:33:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-09 23:33:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-09 23:33:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-09 23:33:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-09 23:33:07,140 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 85 [2018-11-09 23:33:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:07,140 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-09 23:33:07,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-09 23:33:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-09 23:33:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-09 23:33:07,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:07,142 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:07,142 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:07,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash -474560935, now seen corresponding path program 1 times [2018-11-09 23:33:07,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:07,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:07,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:07,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:07,210 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:07,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:07,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:07,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:07,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-09 23:33:07,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-09 23:33:07,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-09 23:33:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:33:07,292 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 10 states. [2018-11-09 23:33:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:07,320 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-09 23:33:07,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-09 23:33:07,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2018-11-09 23:33:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:07,322 INFO L225 Difference]: With dead ends: 141 [2018-11-09 23:33:07,322 INFO L226 Difference]: Without dead ends: 141 [2018-11-09 23:33:07,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:33:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-09 23:33:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-09 23:33:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-09 23:33:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-09 23:33:07,326 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 90 [2018-11-09 23:33:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:07,326 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-09 23:33:07,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-09 23:33:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-09 23:33:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-09 23:33:07,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:07,327 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:07,327 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:07,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:07,328 INFO L82 PathProgramCache]: Analyzing trace with hash 204136418, now seen corresponding path program 2 times [2018-11-09 23:33:07,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:07,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:07,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:07,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:07,439 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:07,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:07,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:07,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:07,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:07,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:07,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:07,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-09 23:33:07,497 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:07,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:07,499 INFO L477 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 17 treesize of output 21 [2018-11-09 23:33:07,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:07,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:07,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-09 23:33:07,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-09 23:33:07,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:07,532 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-09 23:33:07,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-11-09 23:33:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-09 23:33:07,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:07,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-11-09 23:33:07,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-09 23:33:07,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-09 23:33:07,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-09 23:33:07,618 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 12 states. [2018-11-09 23:33:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:07,830 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-11-09 23:33:07,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-09 23:33:07,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-09 23:33:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:07,831 INFO L225 Difference]: With dead ends: 144 [2018-11-09 23:33:07,831 INFO L226 Difference]: Without dead ends: 144 [2018-11-09 23:33:07,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-09 23:33:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-09 23:33:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-11-09 23:33:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-09 23:33:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2018-11-09 23:33:07,835 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 94 [2018-11-09 23:33:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:07,835 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2018-11-09 23:33:07,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-09 23:33:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-09 23:33:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-09 23:33:07,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:07,836 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:07,837 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:07,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1114967276, now seen corresponding path program 1 times [2018-11-09 23:33:07,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:07,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:07,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:07,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:07,911 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:07,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:07,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:08,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:08,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-09 23:33:08,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-09 23:33:08,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-09 23:33:08,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-09 23:33:08,009 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand 12 states. [2018-11-09 23:33:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:08,043 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-09 23:33:08,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-09 23:33:08,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2018-11-09 23:33:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:08,044 INFO L225 Difference]: With dead ends: 148 [2018-11-09 23:33:08,044 INFO L226 Difference]: Without dead ends: 148 [2018-11-09 23:33:08,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-09 23:33:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-09 23:33:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-09 23:33:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-09 23:33:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2018-11-09 23:33:08,048 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 98 [2018-11-09 23:33:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:08,048 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2018-11-09 23:33:08,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-09 23:33:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-09 23:33:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-09 23:33:08,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:08,049 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:08,049 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:08,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1101034123, now seen corresponding path program 2 times [2018-11-09 23:33:08,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:08,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:33:08,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:08,150 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/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-09 23:33:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:08,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:08,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:08,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:08,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:08,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:08,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:08,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:08,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:08,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-09 23:33:08,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:08,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 15 [2018-11-09 23:33:08,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:08,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:08,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:08,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-09 23:33:08,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:08,250 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-09 23:33:08,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-09 23:33:08,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-09 23:33:08,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:08,289 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-09 23:33:08,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-11-09 23:33:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-09 23:33:08,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:08,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2018-11-09 23:33:08,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-09 23:33:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-09 23:33:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-11-09 23:33:08,422 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 16 states. [2018-11-09 23:33:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:08,793 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-11-09 23:33:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-09 23:33:08,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-11-09 23:33:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:08,794 INFO L225 Difference]: With dead ends: 149 [2018-11-09 23:33:08,794 INFO L226 Difference]: Without dead ends: 149 [2018-11-09 23:33:08,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2018-11-09 23:33:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-09 23:33:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-09 23:33:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-09 23:33:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-09 23:33:08,797 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 102 [2018-11-09 23:33:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:08,798 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-09 23:33:08,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-09 23:33:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-09 23:33:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-09 23:33:08,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:08,799 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:08,799 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:08,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1237126766, now seen corresponding path program 1 times [2018-11-09 23:33:08,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:08,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:08,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:08,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:33:08,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:33:08,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 23:33:08,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:33:08,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:33:08,860 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 6 states. [2018-11-09 23:33:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:08,945 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-09 23:33:08,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:33:08,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-11-09 23:33:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:08,946 INFO L225 Difference]: With dead ends: 148 [2018-11-09 23:33:08,947 INFO L226 Difference]: Without dead ends: 148 [2018-11-09 23:33:08,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:33:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-09 23:33:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-09 23:33:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-09 23:33:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2018-11-09 23:33:08,949 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 117 [2018-11-09 23:33:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:08,949 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2018-11-09 23:33:08,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 23:33:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-09 23:33:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-09 23:33:08,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:08,951 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:08,951 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:08,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1237126765, now seen corresponding path program 1 times [2018-11-09 23:33:08,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:08,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:08,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:08,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:09,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:09,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:09,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:09,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-09 23:33:09,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 23:33:09,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 23:33:09,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:33:09,048 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 5 states. [2018-11-09 23:33:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:09,067 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2018-11-09 23:33:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:33:09,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-11-09 23:33:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:09,068 INFO L225 Difference]: With dead ends: 158 [2018-11-09 23:33:09,068 INFO L226 Difference]: Without dead ends: 158 [2018-11-09 23:33:09,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 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-09 23:33:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-09 23:33:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2018-11-09 23:33:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-09 23:33:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-11-09 23:33:09,071 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 117 [2018-11-09 23:33:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:09,071 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-11-09 23:33:09,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 23:33:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-09 23:33:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-09 23:33:09,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:09,072 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:09,072 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:09,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 136718601, now seen corresponding path program 2 times [2018-11-09 23:33:09,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:09,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:09,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:09,135 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:09,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:09,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:09,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:09,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:09,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:09,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-09 23:33:09,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:09,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 15 [2018-11-09 23:33:09,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:09,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:09,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-09 23:33:09,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,221 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-09 23:33:09,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-09 23:33:09,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-09 23:33:09,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,243 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-09 23:33:09,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-11-09 23:33:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-09 23:33:09,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:09,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2018-11-09 23:33:09,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-09 23:33:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-09 23:33:09,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-09 23:33:09,392 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 11 states. [2018-11-09 23:33:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:09,662 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-11-09 23:33:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-09 23:33:09,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2018-11-09 23:33:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:09,665 INFO L225 Difference]: With dead ends: 165 [2018-11-09 23:33:09,665 INFO L226 Difference]: Without dead ends: 165 [2018-11-09 23:33:09,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-09 23:33:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-09 23:33:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-11-09 23:33:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-09 23:33:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-11-09 23:33:09,668 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 123 [2018-11-09 23:33:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:09,671 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-11-09 23:33:09,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-09 23:33:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-11-09 23:33:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-09 23:33:09,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:09,672 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:09,672 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:09,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1748332525, now seen corresponding path program 1 times [2018-11-09 23:33:09,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:09,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:09,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:09,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:09,724 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:09,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:09,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:09,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:09,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-09 23:33:09,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-09 23:33:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-09 23:33:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:33:09,830 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 7 states. [2018-11-09 23:33:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:09,877 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-11-09 23:33:09,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:33:09,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-11-09 23:33:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:09,879 INFO L225 Difference]: With dead ends: 171 [2018-11-09 23:33:09,879 INFO L226 Difference]: Without dead ends: 171 [2018-11-09 23:33:09,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:33:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-09 23:33:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-11-09 23:33:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-09 23:33:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2018-11-09 23:33:09,881 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 130 [2018-11-09 23:33:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:09,882 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2018-11-09 23:33:09,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-09 23:33:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2018-11-09 23:33:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-09 23:33:09,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:09,883 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:09,883 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:09,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:09,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1901307997, now seen corresponding path program 2 times [2018-11-09 23:33:09,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:09,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:09,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:09,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:09,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:09,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:09,931 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:09,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:09,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:09,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:09,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:09,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:09,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:09,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-09 23:33:09,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-09 23:33:10,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:10,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:10,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-11-09 23:33:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-11-09 23:33:10,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:10,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2018-11-09 23:33:10,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-09 23:33:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-09 23:33:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:33:10,060 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 10 states. [2018-11-09 23:33:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:10,157 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2018-11-09 23:33:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 23:33:10,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 136 [2018-11-09 23:33:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:10,158 INFO L225 Difference]: With dead ends: 176 [2018-11-09 23:33:10,158 INFO L226 Difference]: Without dead ends: 176 [2018-11-09 23:33:10,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-09 23:33:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-09 23:33:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-11-09 23:33:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-09 23:33:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2018-11-09 23:33:10,161 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 136 [2018-11-09 23:33:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:10,161 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2018-11-09 23:33:10,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-09 23:33:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2018-11-09 23:33:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-09 23:33:10,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:10,162 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:10,162 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:10,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash 540533030, now seen corresponding path program 1 times [2018-11-09 23:33:10,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:10,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:10,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:10,216 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:10,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:10,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:10,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:10,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-09 23:33:10,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-09 23:33:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-09 23:33:10,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:33:10,300 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand 9 states. [2018-11-09 23:33:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:10,329 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-11-09 23:33:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-09 23:33:10,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 142 [2018-11-09 23:33:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:10,330 INFO L225 Difference]: With dead ends: 182 [2018-11-09 23:33:10,331 INFO L226 Difference]: Without dead ends: 182 [2018-11-09 23:33:10,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:33:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-09 23:33:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2018-11-09 23:33:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-09 23:33:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 182 transitions. [2018-11-09 23:33:10,334 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 182 transitions. Word has length 142 [2018-11-09 23:33:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:10,334 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 182 transitions. [2018-11-09 23:33:10,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-09 23:33:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 182 transitions. [2018-11-09 23:33:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-09 23:33:10,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:10,335 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:10,335 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:10,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:10,336 INFO L82 PathProgramCache]: Analyzing trace with hash 784128624, now seen corresponding path program 2 times [2018-11-09 23:33:10,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:10,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-09 23:33:10,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:10,397 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:10,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:10,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:10,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:10,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:10,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:10,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:10,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:10,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-09 23:33:10,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-09 23:33:10,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:10,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 23:33:10,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-09 23:33:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-09 23:33:10,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:10,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-11-09 23:33:10,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-09 23:33:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-09 23:33:10,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:33:10,497 INFO L87 Difference]: Start difference. First operand 178 states and 182 transitions. Second operand 10 states. [2018-11-09 23:33:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:10,584 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-11-09 23:33:10,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 23:33:10,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2018-11-09 23:33:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:10,585 INFO L225 Difference]: With dead ends: 187 [2018-11-09 23:33:10,585 INFO L226 Difference]: Without dead ends: 187 [2018-11-09 23:33:10,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-11-09 23:33:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-09 23:33:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-11-09 23:33:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-09 23:33:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2018-11-09 23:33:10,588 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 148 [2018-11-09 23:33:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:10,588 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2018-11-09 23:33:10,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-09 23:33:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2018-11-09 23:33:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-09 23:33:10,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:10,589 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:10,589 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:10,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1220078063, now seen corresponding path program 1 times [2018-11-09 23:33:10,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:10,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:10,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-09 23:33:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:33:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:33:10,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 23:33:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:33:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:33:10,637 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 6 states. [2018-11-09 23:33:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:10,712 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-11-09 23:33:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:33:10,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-11-09 23:33:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:10,713 INFO L225 Difference]: With dead ends: 182 [2018-11-09 23:33:10,713 INFO L226 Difference]: Without dead ends: 182 [2018-11-09 23:33:10,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:33:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-09 23:33:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-09 23:33:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-09 23:33:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-11-09 23:33:10,721 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 165 [2018-11-09 23:33:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:10,721 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-11-09 23:33:10,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 23:33:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-11-09 23:33:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-09 23:33:10,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:10,722 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:10,722 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:10,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1220078062, now seen corresponding path program 1 times [2018-11-09 23:33:10,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:10,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:10,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:10,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-09 23:33:10,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:10,777 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:10,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:10,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-09 23:33:10,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:10,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-09 23:33:10,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-09 23:33:10,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-09 23:33:10,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-09 23:33:10,860 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 11 states. [2018-11-09 23:33:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:10,895 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2018-11-09 23:33:10,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 23:33:10,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2018-11-09 23:33:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:10,897 INFO L225 Difference]: With dead ends: 192 [2018-11-09 23:33:10,897 INFO L226 Difference]: Without dead ends: 192 [2018-11-09 23:33:10,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-09 23:33:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-09 23:33:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-11-09 23:33:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-09 23:33:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 192 transitions. [2018-11-09 23:33:10,901 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 192 transitions. Word has length 165 [2018-11-09 23:33:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:10,901 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 192 transitions. [2018-11-09 23:33:10,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-09 23:33:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 192 transitions. [2018-11-09 23:33:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-09 23:33:10,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:10,902 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:10,902 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:10,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:10,903 INFO L82 PathProgramCache]: Analyzing trace with hash -257078904, now seen corresponding path program 2 times [2018-11-09 23:33:10,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:10,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-09 23:33:10,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:10,984 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:10,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:11,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:11,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:11,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:11,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:11,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:11,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:11,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:11,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:11,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-09 23:33:11,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:11,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 15 [2018-11-09 23:33:11,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:11,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:11,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 23:33:11,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-09 23:33:11,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:11,075 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-09 23:33:11,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-09 23:33:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-11-09 23:33:11,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:11,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2018-11-09 23:33:11,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-09 23:33:11,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-09 23:33:11,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-09 23:33:11,327 INFO L87 Difference]: Start difference. First operand 188 states and 192 transitions. Second operand 17 states. [2018-11-09 23:33:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:11,665 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-11-09 23:33:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-09 23:33:11,665 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-11-09 23:33:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:11,666 INFO L225 Difference]: With dead ends: 199 [2018-11-09 23:33:11,666 INFO L226 Difference]: Without dead ends: 199 [2018-11-09 23:33:11,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2018-11-09 23:33:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-09 23:33:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-11-09 23:33:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-09 23:33:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2018-11-09 23:33:11,670 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 171 [2018-11-09 23:33:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:11,670 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2018-11-09 23:33:11,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-09 23:33:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2018-11-09 23:33:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-09 23:33:11,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:11,671 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:11,671 INFO L424 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:11,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1787888404, now seen corresponding path program 1 times [2018-11-09 23:33:11,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:11,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:11,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-09 23:33:11,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:11,785 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:11,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:11,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-09 23:33:11,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:11,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-09 23:33:11,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-09 23:33:11,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-09 23:33:11,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-09 23:33:11,883 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 13 states. [2018-11-09 23:33:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:11,918 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-11-09 23:33:11,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-09 23:33:11,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 178 [2018-11-09 23:33:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:11,921 INFO L225 Difference]: With dead ends: 201 [2018-11-09 23:33:11,921 INFO L226 Difference]: Without dead ends: 201 [2018-11-09 23:33:11,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-09 23:33:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-09 23:33:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-09 23:33:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-09 23:33:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2018-11-09 23:33:11,924 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 178 [2018-11-09 23:33:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:11,924 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2018-11-09 23:33:11,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-09 23:33:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2018-11-09 23:33:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-09 23:33:11,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:11,925 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:11,926 INFO L424 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:11,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1917886302, now seen corresponding path program 2 times [2018-11-09 23:33:11,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:11,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:11,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-09 23:33:11,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:11,967 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:11,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:12,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:12,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:12,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:12,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:12,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:12,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:12,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-09 23:33:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-11-09 23:33:12,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:12,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-11-09 23:33:12,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-09 23:33:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-09 23:33:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:33:12,118 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 7 states. [2018-11-09 23:33:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:12,195 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-11-09 23:33:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-09 23:33:12,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2018-11-09 23:33:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:12,197 INFO L225 Difference]: With dead ends: 210 [2018-11-09 23:33:12,197 INFO L226 Difference]: Without dead ends: 210 [2018-11-09 23:33:12,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:33:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-09 23:33:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-11-09 23:33:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-09 23:33:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 210 transitions. [2018-11-09 23:33:12,200 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 210 transitions. Word has length 184 [2018-11-09 23:33:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:12,200 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 210 transitions. [2018-11-09 23:33:12,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-09 23:33:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 210 transitions. [2018-11-09 23:33:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-09 23:33:12,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:12,201 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:12,201 INFO L424 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:12,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -998337273, now seen corresponding path program 1 times [2018-11-09 23:33:12,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:33:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-11-09 23:33:12,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:33:12,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 23:33:12,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:33:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:33:12,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:33:12,248 INFO L87 Difference]: Start difference. First operand 206 states and 210 transitions. Second operand 3 states. [2018-11-09 23:33:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:12,286 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-11-09 23:33:12,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:33:12,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-11-09 23:33:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:12,288 INFO L225 Difference]: With dead ends: 205 [2018-11-09 23:33:12,288 INFO L226 Difference]: Without dead ends: 205 [2018-11-09 23:33:12,288 INFO L605 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-09 23:33:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-09 23:33:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-11-09 23:33:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-09 23:33:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2018-11-09 23:33:12,290 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 190 [2018-11-09 23:33:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:12,290 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2018-11-09 23:33:12,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:33:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2018-11-09 23:33:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-09 23:33:12,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:12,292 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:12,292 INFO L424 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:12,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -799624090, now seen corresponding path program 1 times [2018-11-09 23:33:12,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:12,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-11-09 23:33:12,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:33:12,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:33:12,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 23:33:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:33:12,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:33:12,344 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 6 states. [2018-11-09 23:33:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:12,431 INFO L93 Difference]: Finished difference Result 204 states and 208 transitions. [2018-11-09 23:33:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:33:12,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2018-11-09 23:33:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:12,432 INFO L225 Difference]: With dead ends: 204 [2018-11-09 23:33:12,433 INFO L226 Difference]: Without dead ends: 204 [2018-11-09 23:33:12,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:33:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-09 23:33:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-11-09 23:33:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-09 23:33:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-11-09 23:33:12,436 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 201 [2018-11-09 23:33:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:12,436 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-11-09 23:33:12,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 23:33:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-11-09 23:33:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-09 23:33:12,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:12,437 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:12,438 INFO L424 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:12,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash -799624089, now seen corresponding path program 1 times [2018-11-09 23:33:12,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:12,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-11-09 23:33:12,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:12,479 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:12,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:12,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-11-09 23:33:12,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:33:12,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-09 23:33:12,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 23:33:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:33:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:33:12,572 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 6 states. [2018-11-09 23:33:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:12,591 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2018-11-09 23:33:12,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 23:33:12,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2018-11-09 23:33:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:12,593 INFO L225 Difference]: With dead ends: 214 [2018-11-09 23:33:12,593 INFO L226 Difference]: Without dead ends: 214 [2018-11-09 23:33:12,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:33:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-09 23:33:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-11-09 23:33:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-09 23:33:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 214 transitions. [2018-11-09 23:33:12,596 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 214 transitions. Word has length 201 [2018-11-09 23:33:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:12,597 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 214 transitions. [2018-11-09 23:33:12,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 23:33:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2018-11-09 23:33:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-09 23:33:12,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:33:12,598 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:33:12,598 INFO L424 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-09 23:33:12,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:33:12,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1542354947, now seen corresponding path program 2 times [2018-11-09 23:33:12,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:33:12,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:33:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:33:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:33:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:33:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-11-09 23:33:12,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:33:12,650 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:33:12,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:33:12,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 23:33:12,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:33:12,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:33:12,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 23:33:12,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 23:33:12,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 23:33:12,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-09 23:33:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-11-09 23:33:12,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:33:12,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-11-09 23:33:12,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-09 23:33:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-09 23:33:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-09 23:33:12,840 INFO L87 Difference]: Start difference. First operand 210 states and 214 transitions. Second operand 11 states. [2018-11-09 23:33:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:33:13,001 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2018-11-09 23:33:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-09 23:33:13,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2018-11-09 23:33:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:33:13,002 INFO L225 Difference]: With dead ends: 221 [2018-11-09 23:33:13,002 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 23:33:13,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-09 23:33:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 23:33:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 23:33:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 23:33:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 23:33:13,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-11-09 23:33:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:33:13,003 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:33:13,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-09 23:33:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 23:33:13,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 23:33:13,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:33:13 BoogieIcfgContainer [2018-11-09 23:33:13,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 23:33:13,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:33:13,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:33:13,007 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:33:13,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:33:01" (3/4) ... [2018-11-09 23:33:13,011 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-09 23:33:13,015 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-09 23:33:13,015 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-11-09 23:33:13,015 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-11-09 23:33:13,016 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-11-09 23:33:13,016 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-09 23:33:13,016 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-11-09 23:33:13,020 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2018-11-09 23:33:13,020 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-09 23:33:13,021 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-09 23:33:13,021 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-09 23:33:13,053 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5aa6fc93-f4f8-458c-ad5c-e382fc2626b9/bin-2019/uautomizer/witness.graphml [2018-11-09 23:33:13,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:33:13,054 INFO L168 Benchmark]: Toolchain (without parser) took 12576.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -244.1 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2018-11-09 23:33:13,055 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:33:13,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-09 23:33:13,055 INFO L168 Benchmark]: Boogie Preprocessor took 29.52 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 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-09 23:33:13,056 INFO L168 Benchmark]: RCFGBuilder took 370.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-09 23:33:13,056 INFO L168 Benchmark]: TraceAbstraction took 11939.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.4 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. [2018-11-09 23:33:13,056 INFO L168 Benchmark]: Witness Printer took 46.25 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:33:13,057 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.52 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 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 370.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11939.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.4 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. * Witness Printer took 46.25 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 121 locations, 17 error locations. SAFE Result, 11.9s OverallTime, 27 OverallIterations, 11 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2366 SDtfs, 2992 SDslu, 9974 SDs, 0 SdLazy, 4248 SolverSat, 397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2873 GetRequests, 2554 SyntacticMatches, 16 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=26, 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.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 52 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 6036 NumberOfCodeBlocks, 5436 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5989 ConstructedInterpolants, 538 QuantifiedInterpolants, 3364865 SizeOfPredicates, 35 NumberOfNonLiveVariables, 5275 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 8824/10940 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...