./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56b28f59847d63942ec468b0c95f39e5b8c0763a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:51:31,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:51:31,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:51:31,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:51:31,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:51:31,777 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:51:31,778 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:51:31,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:51:31,781 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:51:31,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:51:31,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:51:31,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:51:31,783 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:51:31,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:51:31,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:51:31,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:51:31,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:51:31,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:51:31,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:51:31,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:51:31,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:51:31,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:51:31,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:51:31,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:51:31,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:51:31,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:51:31,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:51:31,795 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:51:31,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:51:31,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:51:31,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:51:31,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:51:31,797 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:51:31,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:51:31,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:51:31,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:51:31,798 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-10 03:51:31,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:51:31,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:51:31,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:51:31,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:51:31,807 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:51:31,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:51:31,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:51:31,807 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:51:31,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:51:31,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:51:31,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:51:31,808 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 03:51:31,808 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 03:51:31,808 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 03:51:31,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:51:31,809 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:51:31,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:51:31,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:51:31,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:51:31,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:51:31,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:51:31,810 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:51:31,810 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:51:31,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:51:31,810 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:51:31,810 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_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2018-11-10 03:51:31,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:51:31,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:51:31,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:51:31,846 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:51:31,846 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:51:31,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-10 03:51:31,892 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/data/1dd7ace92/9cab788d07e542a4b5897db6e21847fe/FLAGc1799f896 [2018-11-10 03:51:32,294 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:51:32,295 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-10 03:51:32,299 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/data/1dd7ace92/9cab788d07e542a4b5897db6e21847fe/FLAGc1799f896 [2018-11-10 03:51:32,309 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/data/1dd7ace92/9cab788d07e542a4b5897db6e21847fe [2018-11-10 03:51:32,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:51:32,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:51:32,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:51:32,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:51:32,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:51:32,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ba6664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32, skipping insertion in model container [2018-11-10 03:51:32,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:51:32,336 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:51:32,435 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:51:32,441 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:51:32,452 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:51:32,460 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:51:32,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32 WrapperNode [2018-11-10 03:51:32,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:51:32,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:51:32,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:51:32,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:51:32,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... [2018-11-10 03:51:32,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:51:32,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:51:32,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:51:32,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:51:32,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:32,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:51:32,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:51:32,556 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 03:51:32,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:51:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 03:51:32,718 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:51:32,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:51:32 BoogieIcfgContainer [2018-11-10 03:51:32,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:51:32,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:51:32,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:51:32,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:51:32,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:51:32" (1/3) ... [2018-11-10 03:51:32,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef0303c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:51:32, skipping insertion in model container [2018-11-10 03:51:32,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:51:32" (2/3) ... [2018-11-10 03:51:32,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef0303c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:51:32, skipping insertion in model container [2018-11-10 03:51:32,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:51:32" (3/3) ... [2018-11-10 03:51:32,724 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-10 03:51:32,731 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:51:32,735 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 03:51:32,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 03:51:32,765 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:51:32,766 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:51:32,766 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 03:51:32,766 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:51:32,766 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:51:32,766 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:51:32,766 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:51:32,766 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:51:32,766 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:51:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-10 03:51:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 03:51:32,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:32,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:32,790 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:32,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1496656545, now seen corresponding path program 1 times [2018-11-10 03:51:32,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:32,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:32,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:32,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:32,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:32,873 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 03:51:32,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:32,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:51:32,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:51:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:51:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:51:32,887 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-10 03:51:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:32,898 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-10 03:51:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:51:32,899 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-10 03:51:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:32,904 INFO L225 Difference]: With dead ends: 54 [2018-11-10 03:51:32,904 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 03:51:32,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:51:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 03:51:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-10 03:51:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 03:51:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-11-10 03:51:32,928 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-11-10 03:51:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:32,928 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-11-10 03:51:32,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:51:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-10 03:51:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 03:51:32,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:32,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:32,929 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:32,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 405796804, now seen corresponding path program 1 times [2018-11-10 03:51:32,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:32,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:32,972 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 03:51:32,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:32,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:51:32,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:51:32,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:51:32,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:51:32,974 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 3 states. [2018-11-10 03:51:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,031 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-10 03:51:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:51:33,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 03:51:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,033 INFO L225 Difference]: With dead ends: 74 [2018-11-10 03:51:33,033 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 03:51:33,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:51:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 03:51:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-11-10 03:51:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 03:51:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-10 03:51:33,040 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 15 [2018-11-10 03:51:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,040 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-10 03:51:33,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:51:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-10 03:51:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 03:51:33,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,041 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:33,041 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash -213588543, now seen corresponding path program 1 times [2018-11-10 03:51:33,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,075 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 03:51:33,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:33,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:51:33,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:51:33,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:51:33,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:51:33,076 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 3 states. [2018-11-10 03:51:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,129 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-10 03:51:33,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:51:33,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 03:51:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,131 INFO L225 Difference]: With dead ends: 66 [2018-11-10 03:51:33,131 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 03:51:33,131 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 03:51:33,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 03:51:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-10 03:51:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 03:51:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-10 03:51:33,135 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 16 [2018-11-10 03:51:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,135 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-10 03:51:33,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:51:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-10 03:51:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 03:51:33,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,136 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:33,136 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1968689806, now seen corresponding path program 1 times [2018-11-10 03:51:33,136 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,209 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 03:51:33,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:33,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:51:33,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:51:33,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:51:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:51:33,210 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-11-10 03:51:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,295 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-10 03:51:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:51:33,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-10 03:51:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,296 INFO L225 Difference]: With dead ends: 60 [2018-11-10 03:51:33,296 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 03:51:33,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:51:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 03:51:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-10 03:51:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 03:51:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-10 03:51:33,301 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 17 [2018-11-10 03:51:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,301 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-10 03:51:33,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:51:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-10 03:51:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 03:51:33,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:33,302 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1968689805, now seen corresponding path program 1 times [2018-11-10 03:51:33,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,338 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 03:51:33,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:33,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:51:33,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:51:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:51:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:51:33,339 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2018-11-10 03:51:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,399 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-10 03:51:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:51:33,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 03:51:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,400 INFO L225 Difference]: With dead ends: 56 [2018-11-10 03:51:33,400 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 03:51:33,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:51:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 03:51:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 03:51:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 03:51:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-10 03:51:33,404 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 17 [2018-11-10 03:51:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,405 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 03:51:33,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:51:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-10 03:51:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 03:51:33,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,406 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] [2018-11-10 03:51:33,406 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1411888660, now seen corresponding path program 1 times [2018-11-10 03:51:33,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,473 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 03:51:33,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:33,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:51:33,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:51:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:51:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:51:33,475 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-11-10 03:51:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,545 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-10 03:51:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:51:33,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-10 03:51:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,547 INFO L225 Difference]: With dead ends: 81 [2018-11-10 03:51:33,547 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 03:51:33,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:51:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 03:51:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 60. [2018-11-10 03:51:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 03:51:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-10 03:51:33,552 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 20 [2018-11-10 03:51:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,552 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-10 03:51:33,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:51:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-10 03:51:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 03:51:33,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,553 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] [2018-11-10 03:51:33,553 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1835389063, now seen corresponding path program 1 times [2018-11-10 03:51:33,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,614 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 03:51:33,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:33,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:51:33,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:51:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:51:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:51:33,615 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 7 states. [2018-11-10 03:51:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,686 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-10 03:51:33,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:51:33,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-10 03:51:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,687 INFO L225 Difference]: With dead ends: 93 [2018-11-10 03:51:33,687 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 03:51:33,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:51:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 03:51:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2018-11-10 03:51:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 03:51:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-10 03:51:33,693 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 22 [2018-11-10 03:51:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,693 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-10 03:51:33,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 03:51:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-10 03:51:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 03:51:33,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,694 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] [2018-11-10 03:51:33,694 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1339122636, now seen corresponding path program 1 times [2018-11-10 03:51:33,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:51:33,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:33,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:51:33,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:51:33,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:51:33,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:51:33,741 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 3 states. [2018-11-10 03:51:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,760 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-10 03:51:33,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:51:33,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 03:51:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,761 INFO L225 Difference]: With dead ends: 67 [2018-11-10 03:51:33,761 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 03:51:33,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 03:51:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 03:51:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-10 03:51:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 03:51:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-10 03:51:33,766 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 26 [2018-11-10 03:51:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,766 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-10 03:51:33,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:51:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-10 03:51:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 03:51:33,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,767 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] [2018-11-10 03:51:33,767 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1339122637, now seen corresponding path program 1 times [2018-11-10 03:51:33,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:51:33,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:51:33,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:51:33,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:51:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:51:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:51:33,829 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-11-10 03:51:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:33,901 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-10 03:51:33,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:51:33,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-10 03:51:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:33,902 INFO L225 Difference]: With dead ends: 77 [2018-11-10 03:51:33,902 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 03:51:33,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:51:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 03:51:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-11-10 03:51:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 03:51:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-10 03:51:33,905 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 26 [2018-11-10 03:51:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:33,905 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-10 03:51:33,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:51:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-10 03:51:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 03:51:33,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:33,906 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:33,906 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:33,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash 828759202, now seen corresponding path program 1 times [2018-11-10 03:51:33,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:33,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:33,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 03:51:33,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:33,962 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:33,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:33,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 03:51:34,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:51:34,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-10 03:51:34,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:51:34,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:51:34,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:51:34,052 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 9 states. [2018-11-10 03:51:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:34,169 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-10 03:51:34,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:51:34,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-10 03:51:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:34,170 INFO L225 Difference]: With dead ends: 87 [2018-11-10 03:51:34,170 INFO L226 Difference]: Without dead ends: 84 [2018-11-10 03:51:34,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:51:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-10 03:51:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-11-10 03:51:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 03:51:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-10 03:51:34,174 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 39 [2018-11-10 03:51:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:34,175 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-10 03:51:34,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:51:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-10 03:51:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 03:51:34,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:34,176 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:51:34,176 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:34,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1454565732, now seen corresponding path program 1 times [2018-11-10 03:51:34,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:34,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:51:34,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:34,221 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:34,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:34,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:51:34,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:51:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 03:51:34,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:51:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:51:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:51:34,302 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-11-10 03:51:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:34,352 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-10 03:51:34,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:51:34,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 03:51:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:34,353 INFO L225 Difference]: With dead ends: 102 [2018-11-10 03:51:34,353 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 03:51:34,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 03:51:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 03:51:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2018-11-10 03:51:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 03:51:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-11-10 03:51:34,356 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 39 [2018-11-10 03:51:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:34,356 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-11-10 03:51:34,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:51:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-10 03:51:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 03:51:34,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:34,357 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:34,358 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:34,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash 417916614, now seen corresponding path program 1 times [2018-11-10 03:51:34,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:34,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:51:34,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:34,424 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:34,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:34,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 03:51:34,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:51:34,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-11-10 03:51:34,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:51:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:51:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:51:34,473 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 10 states. [2018-11-10 03:51:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:34,559 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-10 03:51:34,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:51:34,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-10 03:51:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:34,561 INFO L225 Difference]: With dead ends: 96 [2018-11-10 03:51:34,561 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 03:51:34,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:51:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 03:51:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2018-11-10 03:51:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 03:51:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-10 03:51:34,565 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 41 [2018-11-10 03:51:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:34,565 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-10 03:51:34,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:51:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-10 03:51:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 03:51:34,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:34,566 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:34,566 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:34,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 371829914, now seen corresponding path program 2 times [2018-11-10 03:51:34,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:34,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:34,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 03:51:34,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:34,621 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:34,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:51:34,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:51:34,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:51:34,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 03:51:34,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:51:34,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-10 03:51:34,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:51:34,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:51:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:51:34,735 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 10 states. [2018-11-10 03:51:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:34,825 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-11-10 03:51:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:51:34,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-10 03:51:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:34,827 INFO L225 Difference]: With dead ends: 96 [2018-11-10 03:51:34,827 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 03:51:34,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:51:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 03:51:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2018-11-10 03:51:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 03:51:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-11-10 03:51:34,830 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 45 [2018-11-10 03:51:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:34,830 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-11-10 03:51:34,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:51:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-11-10 03:51:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 03:51:34,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:34,831 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:34,832 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:34,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2053135726, now seen corresponding path program 3 times [2018-11-10 03:51:34,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:34,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:34,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:51:34,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 03:51:34,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:34,914 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:34,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:51:34,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 03:51:34,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:51:34,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:34,996 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 03:51:34,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,030 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 03:51:35,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 03:51:35,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:35,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:35,040 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 03:51:35,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:35,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-10 03:51:35,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,056 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 03:51:35,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 03:51:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 03:51:35,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:51:35,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-10 03:51:35,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:51:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:51:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:51:35,219 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 12 states. [2018-11-10 03:51:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:35,438 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-10 03:51:35,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:51:35,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-10 03:51:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:35,439 INFO L225 Difference]: With dead ends: 98 [2018-11-10 03:51:35,439 INFO L226 Difference]: Without dead ends: 98 [2018-11-10 03:51:35,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2018-11-10 03:51:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-10 03:51:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-11-10 03:51:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 03:51:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-11-10 03:51:35,442 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 51 [2018-11-10 03:51:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:35,442 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-11-10 03:51:35,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:51:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-11-10 03:51:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 03:51:35,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:35,444 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 03:51:35,444 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:35,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1729209757, now seen corresponding path program 1 times [2018-11-10 03:51:35,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:35,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:35,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:51:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-10 03:51:35,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:35,510 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:35,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:35,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 87 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 03:51:35,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:51:35,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-10 03:51:35,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:51:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:51:35,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:51:35,616 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 13 states. [2018-11-10 03:51:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:35,758 INFO L93 Difference]: Finished difference Result 181 states and 189 transitions. [2018-11-10 03:51:35,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:51:35,758 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-11-10 03:51:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:35,759 INFO L225 Difference]: With dead ends: 181 [2018-11-10 03:51:35,759 INFO L226 Difference]: Without dead ends: 181 [2018-11-10 03:51:35,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:51:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-10 03:51:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 128. [2018-11-10 03:51:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 03:51:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-11-10 03:51:35,763 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 91 [2018-11-10 03:51:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:35,764 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-11-10 03:51:35,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:51:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-10 03:51:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 03:51:35,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:35,765 INFO L375 BasicCegarLoop]: trace histogram [13, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 03:51:35,765 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:35,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1939395016, now seen corresponding path program 2 times [2018-11-10 03:51:35,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:35,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:35,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:35,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:35,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-10 03:51:35,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:35,845 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:35,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:51:35,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 03:51:35,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:51:35,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:35,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:35,928 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:35,931 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 23 treesize of output 15 [2018-11-10 03:51:35,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:35,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:35,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:35,973 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:35,975 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 23 treesize of output 15 [2018-11-10 03:51:35,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:35,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:35,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:36,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:36,022 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:36,024 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 23 treesize of output 15 [2018-11-10 03:51:36,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:36,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:36,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:36,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:36,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:36,079 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:36,085 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 23 treesize of output 15 [2018-11-10 03:51:36,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:36,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:36,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:36,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:36,127 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |c_main_~#mask~0.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_~#mask~0.base| 1) |main_~#b~0.base| 0))))) is different from true [2018-11-10 03:51:36,132 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int) (|main_~#mask~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |main_~#mask~0.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_~#mask~0.base| 1) |main_~#b~0.base| 0) |main_~#mask~0.base| 0))))) is different from true [2018-11-10 03:51:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-11-10 03:51:36,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:51:36,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-11-10 03:51:36,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:51:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:51:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=82, Unknown=2, NotChecked=38, Total=156 [2018-11-10 03:51:36,180 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 13 states. [2018-11-10 03:51:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:36,546 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2018-11-10 03:51:36,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 03:51:36,547 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2018-11-10 03:51:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:36,548 INFO L225 Difference]: With dead ends: 179 [2018-11-10 03:51:36,548 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 03:51:36,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 117 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=524, Unknown=28, NotChecked=102, Total=812 [2018-11-10 03:51:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 03:51:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-11-10 03:51:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 03:51:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-11-10 03:51:36,552 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 128 [2018-11-10 03:51:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:36,553 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-11-10 03:51:36,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:51:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-11-10 03:51:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 03:51:36,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:36,555 INFO L375 BasicCegarLoop]: trace histogram [17, 12, 12, 12, 12, 12, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:36,555 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:36,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1777389782, now seen corresponding path program 1 times [2018-11-10 03:51:36,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:36,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:36,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:51:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-11-10 03:51:36,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:36,651 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:36,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:36,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 455 proven. 24 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-11-10 03:51:36,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:51:36,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-11-10 03:51:36,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 03:51:36,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 03:51:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:51:36,794 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 17 states. [2018-11-10 03:51:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:37,007 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2018-11-10 03:51:37,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 03:51:37,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 182 [2018-11-10 03:51:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:37,009 INFO L225 Difference]: With dead ends: 224 [2018-11-10 03:51:37,009 INFO L226 Difference]: Without dead ends: 224 [2018-11-10 03:51:37,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-11-10 03:51:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-10 03:51:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 177. [2018-11-10 03:51:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-10 03:51:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 186 transitions. [2018-11-10 03:51:37,014 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 186 transitions. Word has length 182 [2018-11-10 03:51:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:37,015 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 186 transitions. [2018-11-10 03:51:37,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 03:51:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 186 transitions. [2018-11-10 03:51:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-10 03:51:37,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:51:37,017 INFO L375 BasicCegarLoop]: trace histogram [24, 18, 18, 18, 18, 18, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:51:37,018 INFO L424 AbstractCegarLoop]: === Iteration 18 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-10 03:51:37,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:51:37,018 INFO L82 PathProgramCache]: Analyzing trace with hash 582391630, now seen corresponding path program 2 times [2018-11-10 03:51:37,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:51:37,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:51:37,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:37,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:51:37,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:51:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:51:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2018-11-10 03:51:37,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:51:37,139 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/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 03:51:37,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:51:37,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 03:51:37,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:51:37,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:51:37,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:37,206 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:37,208 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 23 treesize of output 15 [2018-11-10 03:51:37,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:37,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:37,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:37,255 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:37,257 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 23 treesize of output 15 [2018-11-10 03:51:37,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:37,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:37,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:37,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:37,302 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 23 treesize of output 15 [2018-11-10 03:51:37,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:37,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:37,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:37,344 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:37,349 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 23 treesize of output 15 [2018-11-10 03:51:37,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:37,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:37,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:37,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:37,432 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 23 treesize of output 15 [2018-11-10 03:51:37,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:37,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:37,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:51:37,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:51:37,500 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 23 treesize of output 15 [2018-11-10 03:51:37,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:51:37,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:51:37,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 03:51:37,546 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |c_main_~#mask~0.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_~#mask~0.base| 1) |main_~#b~0.base| 0))))) is different from true [2018-11-10 03:51:37,551 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int) (|main_~#mask~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |main_~#mask~0.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_~#mask~0.base| 1) |main_~#b~0.base| 0) |main_~#mask~0.base| 0))))) is different from true [2018-11-10 03:51:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-10 03:51:37,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:51:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2018-11-10 03:51:37,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 03:51:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:51:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=113, Unknown=2, NotChecked=46, Total=210 [2018-11-10 03:51:37,673 INFO L87 Difference]: Start difference. First operand 177 states and 186 transitions. Second operand 15 states. [2018-11-10 03:51:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:51:37,900 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2018-11-10 03:51:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 03:51:37,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2018-11-10 03:51:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:51:37,900 INFO L225 Difference]: With dead ends: 196 [2018-11-10 03:51:37,900 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:51:37,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 221 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=296, Unknown=2, NotChecked=78, Total=506 [2018-11-10 03:51:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:51:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:51:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:51:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:51:37,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2018-11-10 03:51:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:51:37,902 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:51:37,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 03:51:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:51:37,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:51:37,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:51:37 BoogieIcfgContainer [2018-11-10 03:51:37,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:51:37,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:51:37,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:51:37,907 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:51:37,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:51:32" (3/4) ... [2018-11-10 03:51:37,910 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:51:37,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:51:37,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-10 03:51:37,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:51:37,920 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-10 03:51:37,920 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 03:51:37,921 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 03:51:37,921 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:51:37,955 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c90866c-06c0-46c9-87e9-2dbcc2e64f7a/bin-2019/uautomizer/witness.graphml [2018-11-10 03:51:37,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:51:37,956 INFO L168 Benchmark]: Toolchain (without parser) took 5644.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 960.3 MB in the beginning and 864.5 MB in the end (delta: 95.8 MB). Peak memory consumption was 301.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:51:37,957 INFO L168 Benchmark]: CDTParser took 0.15 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 03:51:37,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.36 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:51:37,958 INFO L168 Benchmark]: Boogie Preprocessor took 23.62 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:51:37,958 INFO L168 Benchmark]: RCFGBuilder took 233.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:51:37,959 INFO L168 Benchmark]: TraceAbstraction took 5187.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 864.5 MB in the end (delta: 245.9 MB). Peak memory consumption was 322.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:51:37,959 INFO L168 Benchmark]: Witness Printer took 48.82 ms. Allocated memory is still 1.2 GB. Free memory is still 864.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:51:37,960 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.15 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 148.36 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.62 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 233.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5187.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 864.5 MB in the end (delta: 245.9 MB). Peak memory consumption was 322.0 MB. Max. memory is 11.5 GB. * Witness Printer took 48.82 ms. Allocated memory is still 1.2 GB. Free memory is still 864.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 8 error locations. SAFE Result, 5.1s OverallTime, 18 OverallIterations, 24 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 731 SDtfs, 1519 SDslu, 2048 SDs, 0 SdLazy, 2209 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1008 GetRequests, 813 SyntacticMatches, 23 SemanticMatches, 172 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=17, 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, 18 MinimizatonAttempts, 262 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1877 NumberOfCodeBlocks, 1543 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1850 ConstructedInterpolants, 273 QuantifiedInterpolants, 1617303 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 5202/5533 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...