./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.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_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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 e872a0dffbf376eb2d8b1e3516401a8dafe115a6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:31:04,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:31:04,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:31:04,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:31:04,966 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:31:04,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:31:04,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:31:04,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:31:04,970 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:31:04,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:31:04,971 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:31:04,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:31:04,972 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:31:04,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:31:04,973 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:31:04,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:31:04,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:31:04,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:31:04,976 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:31:04,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:31:04,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:31:04,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:31:04,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:31:04,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:31:04,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:31:04,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:31:04,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:31:04,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:31:04,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:31:04,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:31:04,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:31:04,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:31:04,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:31:04,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:31:04,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:31:04,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:31:04,987 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-10 12:31:04,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:31:04,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:31:04,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:31:04,997 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:31:04,997 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:31:04,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:31:04,997 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:31:04,997 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:31:04,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:31:04,998 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:31:04,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:31:04,998 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 12:31:04,998 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 12:31:04,998 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 12:31:04,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:31:04,998 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:31:04,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:31:04,999 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:31:04,999 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:31:04,999 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:31:04,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:31:04,999 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:31:04,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:31:04,999 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:31:05,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:31:05,000 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_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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 -> e872a0dffbf376eb2d8b1e3516401a8dafe115a6 [2018-11-10 12:31:05,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:31:05,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:31:05,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:31:05,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:31:05,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:31:05,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-10 12:31:05,079 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/data/3d6899746/ceecd41a97c44435afe6cf3567d2208e/FLAG96068210c [2018-11-10 12:31:05,471 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:31:05,472 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-10 12:31:05,475 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/data/3d6899746/ceecd41a97c44435afe6cf3567d2208e/FLAG96068210c [2018-11-10 12:31:05,485 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/data/3d6899746/ceecd41a97c44435afe6cf3567d2208e [2018-11-10 12:31:05,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:31:05,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:31:05,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:31:05,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:31:05,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:31:05,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11661478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05, skipping insertion in model container [2018-11-10 12:31:05,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:31:05,520 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:31:05,627 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:31:05,633 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:31:05,643 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:31:05,653 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:31:05,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05 WrapperNode [2018-11-10 12:31:05,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:31:05,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:31:05,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:31:05,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:31:05,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... [2018-11-10 12:31:05,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:31:05,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:31:05,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:31:05,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:31:05,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:31:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:31:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-10 12:31:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-10 12:31:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:31:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-10 12:31:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:31:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-10 12:31:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:31:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:31:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:31:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:31:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:31:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:31:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:31:05,910 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:31:05,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:31:05 BoogieIcfgContainer [2018-11-10 12:31:05,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:31:05,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:31:05,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:31:05,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:31:05,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:31:05" (1/3) ... [2018-11-10 12:31:05,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35789ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:31:05, skipping insertion in model container [2018-11-10 12:31:05,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:31:05" (2/3) ... [2018-11-10 12:31:05,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35789ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:31:05, skipping insertion in model container [2018-11-10 12:31:05,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:31:05" (3/3) ... [2018-11-10 12:31:05,916 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2_false-valid-deref.c [2018-11-10 12:31:05,923 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:31:05,927 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-10 12:31:05,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-10 12:31:05,958 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:31:05,959 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:31:05,959 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 12:31:05,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:31:05,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:31:05,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:31:05,959 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:31:05,959 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:31:05,959 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:31:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-10 12:31:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:31:05,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:05,981 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] [2018-11-10 12:31:05,982 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:05,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1100346467, now seen corresponding path program 1 times [2018-11-10 12:31:05,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:05,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:06,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:06,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:06,128 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-10 12:31:06,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:31:06,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:31:06,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:31:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:31:06,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:31:06,143 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-11-10 12:31:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:06,217 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-10 12:31:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:31:06,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:31:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:06,225 INFO L225 Difference]: With dead ends: 55 [2018-11-10 12:31:06,225 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 12:31:06,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10 12:31:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 12:31:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-10 12:31:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 12:31:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-10 12:31:06,249 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 22 [2018-11-10 12:31:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:06,249 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-10 12:31:06,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:31:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-10 12:31:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:31:06,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:06,250 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] [2018-11-10 12:31:06,250 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:06,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1100346466, now seen corresponding path program 1 times [2018-11-10 12:31:06,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:06,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:06,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:06,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:06,337 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-10 12:31:06,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:31:06,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:31:06,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:31:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:31:06,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:31:06,340 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 4 states. [2018-11-10 12:31:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:06,403 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-10 12:31:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:31:06,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-10 12:31:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:06,404 INFO L225 Difference]: With dead ends: 56 [2018-11-10 12:31:06,404 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 12:31:06,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:31:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 12:31:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-10 12:31:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 12:31:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-10 12:31:06,408 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 22 [2018-11-10 12:31:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:06,408 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-10 12:31:06,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:31:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-10 12:31:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:31:06,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:06,409 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] [2018-11-10 12:31:06,409 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:06,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash 488779829, now seen corresponding path program 1 times [2018-11-10 12:31:06,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:06,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:31:06,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:31:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:31:06,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:31:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:31:06,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:31:06,555 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 6 states. [2018-11-10 12:31:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:06,650 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-10 12:31:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:31:06,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-10 12:31:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:06,651 INFO L225 Difference]: With dead ends: 55 [2018-11-10 12:31:06,651 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 12:31:06,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:31:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 12:31:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-10 12:31:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 12:31:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-10 12:31:06,655 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 26 [2018-11-10 12:31:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:06,655 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-10 12:31:06,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:31:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-10 12:31:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 12:31:06,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:06,656 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:31:06,656 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:06,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1916440602, now seen corresponding path program 1 times [2018-11-10 12:31:06,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:06,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:06,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:31:06,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:06,701 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:06,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:06,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:31:06,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:06,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 12:31:06,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:31:06,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:31:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:31:06,774 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 5 states. [2018-11-10 12:31:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:06,788 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-10 12:31:06,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:31:06,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 12:31:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:06,789 INFO L225 Difference]: With dead ends: 59 [2018-11-10 12:31:06,790 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 12:31:06,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-10 12:31:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 12:31:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-10 12:31:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 12:31:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-10 12:31:06,794 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 34 [2018-11-10 12:31:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:06,794 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 12:31:06,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:31:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-10 12:31:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:31:06,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:06,795 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-10 12:31:06,795 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:06,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1263506947, now seen corresponding path program 2 times [2018-11-10 12:31:06,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:06,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:06,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:06,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:31:06,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:06,837 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:06,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:31:06,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:31:06,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:06,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:06,874 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-10 12:31:06,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:31:06,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:31:06,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:31:06,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:31:06,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:31:06,926 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-10 12:31:06,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:31:06,932 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-10 12:31:06,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-10 12:31:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 12:31:06,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:31:06,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2018-11-10 12:31:06,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:31:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:31:06,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:31:06,985 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 10 states. [2018-11-10 12:31:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:07,133 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-10 12:31:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:31:07,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-10 12:31:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:07,134 INFO L225 Difference]: With dead ends: 62 [2018-11-10 12:31:07,134 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 12:31:07,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:31:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 12:31:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-10 12:31:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 12:31:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-10 12:31:07,139 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 38 [2018-11-10 12:31:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:07,140 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-10 12:31:07,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:31:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-10 12:31:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:31:07,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:07,141 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-10 12:31:07,141 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:07,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 450003093, now seen corresponding path program 1 times [2018-11-10 12:31:07,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:07,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:07,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:31:07,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:07,188 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:07,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:31:07,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:07,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 12:31:07,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:31:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:31:07,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:31:07,272 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 7 states. [2018-11-10 12:31:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:07,296 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-10 12:31:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:31:07,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-10 12:31:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:07,298 INFO L225 Difference]: With dead ends: 66 [2018-11-10 12:31:07,298 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 12:31:07,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-10 12:31:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 12:31:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-10 12:31:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 12:31:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-10 12:31:07,303 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 42 [2018-11-10 12:31:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:07,303 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 12:31:07,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:31:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-10 12:31:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 12:31:07,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:07,304 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] [2018-11-10 12:31:07,304 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:07,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -565611604, now seen corresponding path program 2 times [2018-11-10 12:31:07,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:07,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:07,395 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-10 12:31:07,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:07,395 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:07,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:31:07,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:31:07,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:07,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:07,426 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-10 12:31:07,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:31:07,437 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-10 12:31:07,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:31:07,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:31:07,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 12:31:07,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:31:07,513 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-10 12:31:07,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:31:07,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:31:07,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:31:07,530 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-10 12:31:07,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:31:07,535 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-10 12:31:07,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-10 12:31:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 12:31:07,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:31:07,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2018-11-10 12:31:07,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 12:31:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 12:31:07,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:31:07,617 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2018-11-10 12:31:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:07,942 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-10 12:31:07,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 12:31:07,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-11-10 12:31:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:07,943 INFO L225 Difference]: With dead ends: 71 [2018-11-10 12:31:07,943 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 12:31:07,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-11-10 12:31:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 12:31:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-10 12:31:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 12:31:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-10 12:31:07,948 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 46 [2018-11-10 12:31:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:07,948 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-10 12:31:07,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 12:31:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-10 12:31:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:31:07,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:07,949 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] [2018-11-10 12:31:07,952 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:07,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1307745027, now seen corresponding path program 1 times [2018-11-10 12:31:07,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:07,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:07,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:07,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:07,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:07,980 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-10 12:31:07,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:31:07,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:31:07,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:31:07,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:31:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:31:07,981 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 3 states. [2018-11-10 12:31:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:07,990 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-10 12:31:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:31:07,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-10 12:31:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:07,993 INFO L225 Difference]: With dead ends: 68 [2018-11-10 12:31:07,993 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 12:31:07,994 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-10 12:31:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 12:31:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 12:31:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 12:31:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-10 12:31:07,997 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 51 [2018-11-10 12:31:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:07,997 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-10 12:31:07,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:31:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-10 12:31:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:31:07,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:07,998 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] [2018-11-10 12:31:07,999 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:07,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1307745026, now seen corresponding path program 1 times [2018-11-10 12:31:07,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:07,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:08,056 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-10 12:31:08,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:08,056 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:08,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:08,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:08,090 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-10 12:31:08,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:08,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 12:31:08,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:31:08,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:31:08,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:31:08,107 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 9 states. [2018-11-10 12:31:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:08,124 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-10 12:31:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:31:08,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-10 12:31:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:08,125 INFO L225 Difference]: With dead ends: 74 [2018-11-10 12:31:08,125 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:31:08,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 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-10 12:31:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:31:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-10 12:31:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:31:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-10 12:31:08,129 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 51 [2018-11-10 12:31:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:08,129 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-10 12:31:08,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:31:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-10 12:31:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 12:31:08,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:08,130 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] [2018-11-10 12:31:08,131 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:08,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:08,131 INFO L82 PathProgramCache]: Analyzing trace with hash 475069383, now seen corresponding path program 2 times [2018-11-10 12:31:08,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:08,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:08,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:08,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:08,200 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-10 12:31:08,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:08,201 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:08,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:31:08,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:31:08,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:08,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:08,232 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-10 12:31:08,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:31:08,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:31:08,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:31:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 12:31:08,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:31:08,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-11-10 12:31:08,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:31:08,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:31:08,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:31:08,292 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 12 states. [2018-11-10 12:31:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:08,343 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-11-10 12:31:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:31:08,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-10 12:31:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:08,343 INFO L225 Difference]: With dead ends: 77 [2018-11-10 12:31:08,343 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 12:31:08,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:31:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 12:31:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-10 12:31:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 12:31:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-10 12:31:08,346 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 55 [2018-11-10 12:31:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:08,346 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-10 12:31:08,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:31:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-10 12:31:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 12:31:08,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:08,347 INFO L375 BasicCegarLoop]: trace histogram [8, 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] [2018-11-10 12:31:08,347 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:08,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1029285085, now seen corresponding path program 1 times [2018-11-10 12:31:08,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:08,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:08,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:08,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:31:08,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:08,395 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:08,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:08,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:31:08,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:08,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 12:31:08,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:31:08,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:31:08,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:31:08,479 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 11 states. [2018-11-10 12:31:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:08,507 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-11-10 12:31:08,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:31:08,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-10 12:31:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:08,508 INFO L225 Difference]: With dead ends: 81 [2018-11-10 12:31:08,509 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 12:31:08,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 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-10 12:31:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 12:31:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-10 12:31:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 12:31:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-10 12:31:08,512 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2018-11-10 12:31:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:08,513 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-10 12:31:08,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:31:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-10 12:31:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 12:31:08,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:08,514 INFO L375 BasicCegarLoop]: trace histogram [9, 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] [2018-11-10 12:31:08,514 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:08,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:08,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1608753012, now seen corresponding path program 2 times [2018-11-10 12:31:08,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:08,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:31:08,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:08,596 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:31:08,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:31:08,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:08,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-10 12:31:08,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:08,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2018-11-10 12:31:08,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:31:08,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:31:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:31:08,705 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 13 states. [2018-11-10 12:31:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:08,755 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-11-10 12:31:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:31:08,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-11-10 12:31:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:08,755 INFO L225 Difference]: With dead ends: 95 [2018-11-10 12:31:08,756 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 12:31:08,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:31:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 12:31:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-11-10 12:31:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 12:31:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-11-10 12:31:08,759 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 74 [2018-11-10 12:31:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:08,759 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-11-10 12:31:08,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:31:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-10 12:31:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 12:31:08,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:08,761 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 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] [2018-11-10 12:31:08,761 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:08,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash 663906497, now seen corresponding path program 3 times [2018-11-10 12:31:08,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:08,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:08,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:08,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 12:31:08,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:08,867 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:08,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:31:08,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 12:31:08,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:08,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 12:31:08,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:08,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-10 12:31:08,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:31:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:31:08,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:31:08,984 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 15 states. [2018-11-10 12:31:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:09,035 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-11-10 12:31:09,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 12:31:09,036 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-10 12:31:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:09,036 INFO L225 Difference]: With dead ends: 103 [2018-11-10 12:31:09,036 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 12:31:09,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:31:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 12:31:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-10 12:31:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 12:31:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-11-10 12:31:09,039 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 84 [2018-11-10 12:31:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:09,039 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-11-10 12:31:09,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:31:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-11-10 12:31:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:31:09,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:09,040 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] [2018-11-10 12:31:09,040 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:09,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2143888270, now seen corresponding path program 4 times [2018-11-10 12:31:09,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:09,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:09,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:09,084 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-10 12:31:09,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:09,084 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:09,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:31:09,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:31:09,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:09,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:09,136 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-10 12:31:09,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:09,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 12:31:09,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:31:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:31:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:31:09,156 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 7 states. [2018-11-10 12:31:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:09,172 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-11-10 12:31:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:31:09,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-10 12:31:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:09,173 INFO L225 Difference]: With dead ends: 109 [2018-11-10 12:31:09,173 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 12:31:09,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 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-10 12:31:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 12:31:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-10 12:31:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 12:31:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-11-10 12:31:09,176 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 94 [2018-11-10 12:31:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:09,177 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-11-10 12:31:09,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:31:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-11-10 12:31:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 12:31:09,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:09,178 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] [2018-11-10 12:31:09,178 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:09,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1461188732, now seen corresponding path program 5 times [2018-11-10 12:31:09,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:09,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:09,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:09,230 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-10 12:31:09,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:09,230 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 12:31:09,420 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-10 12:31:09,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:09,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:09,454 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-10 12:31:09,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:09,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 12:31:09,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:31:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:31:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:31:09,483 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 8 states. [2018-11-10 12:31:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:09,508 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-11-10 12:31:09,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:31:09,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-11-10 12:31:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:09,509 INFO L225 Difference]: With dead ends: 115 [2018-11-10 12:31:09,509 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 12:31:09,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 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-10 12:31:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 12:31:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-11-10 12:31:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 12:31:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-11-10 12:31:09,511 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 100 [2018-11-10 12:31:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:09,512 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-11-10 12:31:09,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:31:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-11-10 12:31:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:31:09,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:09,513 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] [2018-11-10 12:31:09,514 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:09,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -11691270, now seen corresponding path program 6 times [2018-11-10 12:31:09,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:09,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:09,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:09,558 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-10 12:31:09,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:09,558 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:09,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 12:31:09,968 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-10 12:31:09,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:09,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 38 proven. 70 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 12:31:10,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:10,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 11 [2018-11-10 12:31:10,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:31:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:31:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:31:10,007 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 11 states. [2018-11-10 12:31:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:10,037 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-11-10 12:31:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:31:10,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2018-11-10 12:31:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:10,039 INFO L225 Difference]: With dead ends: 121 [2018-11-10 12:31:10,039 INFO L226 Difference]: Without dead ends: 121 [2018-11-10 12:31:10,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:31:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-10 12:31:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-11-10 12:31:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-10 12:31:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-11-10 12:31:10,041 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2018-11-10 12:31:10,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:10,041 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-11-10 12:31:10,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:31:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-11-10 12:31:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 12:31:10,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:10,042 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] [2018-11-10 12:31:10,043 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:10,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash -870826512, now seen corresponding path program 7 times [2018-11-10 12:31:10,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:10,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:10,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:10,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:10,136 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-10 12:31:10,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:10,137 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:10,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:10,203 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-10 12:31:10,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:10,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 12:31:10,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:31:10,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:31:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:31:10,222 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 10 states. [2018-11-10 12:31:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:10,279 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-11-10 12:31:10,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:31:10,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-11-10 12:31:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:10,280 INFO L225 Difference]: With dead ends: 127 [2018-11-10 12:31:10,280 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 12:31:10,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 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-10 12:31:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 12:31:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-11-10 12:31:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 12:31:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-11-10 12:31:10,283 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 112 [2018-11-10 12:31:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:10,283 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-11-10 12:31:10,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:31:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-11-10 12:31:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 12:31:10,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:10,284 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 7, 7, 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] [2018-11-10 12:31:10,284 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:10,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -534884250, now seen corresponding path program 8 times [2018-11-10 12:31:10,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:10,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:10,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:31:10,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:31:10,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:10,334 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:10,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:31:10,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:31:10,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:10,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:31:10,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:10,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 12:31:10,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:31:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:31:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:31:10,413 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 11 states. [2018-11-10 12:31:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:10,446 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-11-10 12:31:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:31:10,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-10 12:31:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:10,448 INFO L225 Difference]: With dead ends: 133 [2018-11-10 12:31:10,448 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 12:31:10,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 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-10 12:31:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 12:31:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-11-10 12:31:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 12:31:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-11-10 12:31:10,450 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 118 [2018-11-10 12:31:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:10,451 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-11-10 12:31:10,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:31:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-11-10 12:31:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 12:31:10,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:10,451 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 8, 8, 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] [2018-11-10 12:31:10,452 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:10,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash -370265508, now seen corresponding path program 9 times [2018-11-10 12:31:10,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:10,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:31:10,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:10,525 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:31:10,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-10 12:31:10,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:10,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:31:10,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:10,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 12:31:10,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:31:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:31:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:31:10,710 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 12 states. [2018-11-10 12:31:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:10,743 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-11-10 12:31:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:31:10,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 124 [2018-11-10 12:31:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:10,745 INFO L225 Difference]: With dead ends: 139 [2018-11-10 12:31:10,745 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 12:31:10,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 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-10 12:31:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 12:31:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-10 12:31:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 12:31:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-11-10 12:31:10,748 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 124 [2018-11-10 12:31:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:10,748 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-11-10 12:31:10,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:31:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-11-10 12:31:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 12:31:10,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:10,749 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 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] [2018-11-10 12:31:10,749 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:10,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1271808978, now seen corresponding path program 10 times [2018-11-10 12:31:10,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:10,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:31:10,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:31:10,824 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/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-10 12:31:10,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:31:10,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:31:10,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:31:10,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:31:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:31:10,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:31:10,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 12:31:10,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:31:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:31:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:31:10,903 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 13 states. [2018-11-10 12:31:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:31:10,936 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-11-10 12:31:10,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:31:10,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-10 12:31:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:31:10,936 INFO L225 Difference]: With dead ends: 141 [2018-11-10 12:31:10,936 INFO L226 Difference]: Without dead ends: 141 [2018-11-10 12:31:10,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 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-10 12:31:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-10 12:31:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-11-10 12:31:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 12:31:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-11-10 12:31:10,938 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 130 [2018-11-10 12:31:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:31:10,938 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-11-10 12:31:10,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:31:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-11-10 12:31:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 12:31:10,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:31:10,939 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:31:10,939 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:31:10,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:31:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1908204744, now seen corresponding path program 11 times [2018-11-10 12:31:10,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:31:10,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:31:10,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:31:10,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:31:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:31:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:31:11,065 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:31:11,089 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 46 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:31:11,090 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:31:11,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:31:11 BoogieIcfgContainer [2018-11-10 12:31:11,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:31:11,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:31:11,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:31:11,109 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:31:11,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:31:05" (3/4) ... [2018-11-10 12:31:11,111 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:31:11,116 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 46 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:31:11,117 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:31:11,156 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fec0619e-27e9-41d4-9c2f-f61338ad52e5/bin-2019/uautomizer/witness.graphml [2018-11-10 12:31:11,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:31:11,156 INFO L168 Benchmark]: Toolchain (without parser) took 5667.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -218.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:31:11,157 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:31:11,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:31:11,158 INFO L168 Benchmark]: Boogie Preprocessor took 22.08 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:31:11,158 INFO L168 Benchmark]: RCFGBuilder took 234.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:31:11,158 INFO L168 Benchmark]: TraceAbstraction took 5196.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.0 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:31:11,159 INFO L168 Benchmark]: Witness Printer took 47.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:31:11,160 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.08 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5196.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.0 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. * Witness Printer took 47.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 46 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 46 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] FCALL int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] FCALL array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] FCALL array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] FCALL array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] FCALL array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] FCALL array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] FCALL array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] FCALL array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] FCALL array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] FCALL array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] FCALL array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] RET return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] FCALL int numbers2[10]; VAL [array={42:0}, numbers={42:0}, numbers2={43:0}] [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={43:0}, numbers[i]=0] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={43:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={43:0}, numbers[i]=1] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={43:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={43:0}, numbers[i]=2] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={43:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={43:0}, numbers[i]=3] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={43:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={43:0}, numbers[i]=4] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={43:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={43:0}, numbers[i]=5] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={43:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={43:0}, numbers[i]=6] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={43:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={43:0}, numbers[i]=7] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={43:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={43:0}, numbers[i]=8] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={43:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={43:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={43:0}] [L18] EXPR, FCALL numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={43:0}, numbers[i]=9] [L18] FCALL numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={43:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={43:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={43:0}] [L21] return numbers2; VAL [\result={43:0}, array={42:0}, i=10, numbers={42:0}, numbers2={43:0}] [L21] RET return numbers2; VAL [\result={43:0}, array={42:0}, i=10, numbers={42:0}] [L25] EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={43:0}] [L25] int *numbers = getNumbers2(); [L26] FCALL numbers[0] = 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 9 error locations. UNSAFE Result, 5.1s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 811 SDtfs, 521 SDslu, 4138 SDs, 0 SdLazy, 1343 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1432 GetRequests, 1271 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 51 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2813 NumberOfCodeBlocks, 2711 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2641 ConstructedInterpolants, 8 QuantifiedInterpolants, 443362 SizeOfPredicates, 28 NumberOfNonLiveVariables, 3222 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 36 InterpolantComputations, 7 PerfectInterpolantSequences, 3271/5617 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...