./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/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 37ce12f320cb92b62d01decbfb4f63ee1143a42a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:38:53,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:38:53,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:38:53,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:38:53,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:38:53,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:38:53,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:38:53,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:38:53,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:38:53,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:38:53,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:38:53,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:38:53,324 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:38:53,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:38:53,325 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:38:53,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:38:53,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:38:53,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:38:53,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:38:53,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:38:53,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:38:53,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:38:53,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:38:53,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:38:53,331 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:38:53,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:38:53,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:38:53,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:38:53,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:38:53,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:38:53,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:38:53,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:38:53,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:38:53,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:38:53,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:38:53,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:38:53,335 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 00:38:53,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:38:53,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:38:53,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:38:53,343 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:38:53,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:38:53,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:38:53,343 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:38:53,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:38:53,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:38:53,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:38:53,344 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:38:53,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:38:53,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:38:53,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:38:53,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:38:53,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:38:53,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:38:53,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:38:53,345 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:38:53,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:38:53,345 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_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/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 -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-12-09 00:38:53,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:38:53,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:38:53,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:38:53,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:38:53,372 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:38:53,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:38:53,406 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/data/57869558f/5ea2dfe0c60e47589e37e5aacc700762/FLAG2aefc18fa [2018-12-09 00:38:53,802 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:38:53,802 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:38:53,808 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/data/57869558f/5ea2dfe0c60e47589e37e5aacc700762/FLAG2aefc18fa [2018-12-09 00:38:53,817 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/data/57869558f/5ea2dfe0c60e47589e37e5aacc700762 [2018-12-09 00:38:53,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:38:53,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 00:38:53,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:38:53,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:38:53,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:38:53,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:38:53" (1/1) ... [2018-12-09 00:38:53,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3ff299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:53, skipping insertion in model container [2018-12-09 00:38:53,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:38:53" (1/1) ... [2018-12-09 00:38:53,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:38:53,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:38:54,015 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:38:54,053 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:38:54,081 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:38:54,104 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:38:54,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54 WrapperNode [2018-12-09 00:38:54,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:38:54,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:38:54,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:38:54,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:38:54,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... [2018-12-09 00:38:54,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... [2018-12-09 00:38:54,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... [2018-12-09 00:38:54,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... [2018-12-09 00:38:54,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... [2018-12-09 00:38:54,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... [2018-12-09 00:38:54,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... [2018-12-09 00:38:54,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:38:54,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:38:54,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:38:54,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:38:54,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/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-12-09 00:38:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:38:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:38:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 00:38:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 00:38:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-12-09 00:38:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:38:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 00:38:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 00:38:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 00:38:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 00:38:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 00:38:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 00:38:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 00:38:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 00:38:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 00:38:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-12-09 00:38:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:38:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:38:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:38:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:38:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:38:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:38:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:38:54,389 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:38:54,389 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 00:38:54,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:38:54 BoogieIcfgContainer [2018-12-09 00:38:54,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:38:54,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:38:54,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:38:54,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:38:54,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:38:53" (1/3) ... [2018-12-09 00:38:54,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbc53c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:38:54, skipping insertion in model container [2018-12-09 00:38:54,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:38:54" (2/3) ... [2018-12-09 00:38:54,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbc53c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:38:54, skipping insertion in model container [2018-12-09 00:38:54,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:38:54" (3/3) ... [2018-12-09 00:38:54,394 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:38:54,400 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:38:54,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 00:38:54,415 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 00:38:54,430 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:38:54,430 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:38:54,431 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 00:38:54,431 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:38:54,431 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:38:54,431 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:38:54,431 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:38:54,431 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:38:54,431 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:38:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-12-09 00:38:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:38:54,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:54,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:54,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:54,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash -339131128, now seen corresponding path program 1 times [2018-12-09 00:38:54,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:54,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:54,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:54,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:38:54,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:38:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:38:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:38:54,558 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-12-09 00:38:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:54,592 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-12-09 00:38:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:38:54,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 00:38:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:54,599 INFO L225 Difference]: With dead ends: 38 [2018-12-09 00:38:54,599 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 00:38:54,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:38:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 00:38:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-09 00:38:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 00:38:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-09 00:38:54,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 10 [2018-12-09 00:38:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:54,620 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-09 00:38:54,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:38:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-09 00:38:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:38:54,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:54,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:54,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:54,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash -339131127, now seen corresponding path program 1 times [2018-12-09 00:38:54,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:54,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:54,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:54,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:54,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:54,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:38:54,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:38:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:38:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:38:54,653 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-12-09 00:38:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:54,665 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-09 00:38:54,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:38:54,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 00:38:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:54,666 INFO L225 Difference]: With dead ends: 34 [2018-12-09 00:38:54,666 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 00:38:54,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:38:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 00:38:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 00:38:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 00:38:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-09 00:38:54,669 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2018-12-09 00:38:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:54,669 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-09 00:38:54,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:38:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-09 00:38:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:38:54,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:54,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:54,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:54,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:54,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1923130343, now seen corresponding path program 1 times [2018-12-09 00:38:54,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:54,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:54,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:54,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:38:54,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:38:54,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:38:54,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:38:54,714 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-12-09 00:38:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:54,725 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-09 00:38:54,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:38:54,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 00:38:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:54,726 INFO L225 Difference]: With dead ends: 33 [2018-12-09 00:38:54,726 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 00:38:54,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:38:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 00:38:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 00:38:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:38:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 00:38:54,729 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 11 [2018-12-09 00:38:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:54,729 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 00:38:54,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:38:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 00:38:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:38:54,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:54,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:54,730 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:54,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1923130344, now seen corresponding path program 1 times [2018-12-09 00:38:54,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:54,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:54,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:54,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:38:54,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:38:54,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:38:54,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:38:54,754 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-12-09 00:38:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:54,764 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-09 00:38:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:38:54,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 00:38:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:54,765 INFO L225 Difference]: With dead ends: 32 [2018-12-09 00:38:54,765 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 00:38:54,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:38:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 00:38:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 00:38:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 00:38:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-09 00:38:54,767 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2018-12-09 00:38:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:54,767 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-09 00:38:54,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:38:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-09 00:38:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:38:54,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:54,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:54,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:54,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash -675861453, now seen corresponding path program 1 times [2018-12-09 00:38:54,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:54,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:54,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:38:54,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:38:54,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:38:54,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:38:54,802 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-12-09 00:38:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:54,847 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-09 00:38:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:38:54,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 00:38:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:54,848 INFO L225 Difference]: With dead ends: 31 [2018-12-09 00:38:54,849 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 00:38:54,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:38:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 00:38:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 00:38:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 00:38:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-09 00:38:54,852 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2018-12-09 00:38:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:54,852 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-09 00:38:54,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:38:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-09 00:38:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:38:54,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:54,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:54,853 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:54,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash -675861452, now seen corresponding path program 1 times [2018-12-09 00:38:54,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:54,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:54,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:54,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:54,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:54,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:38:54,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:38:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:38:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:38:54,915 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2018-12-09 00:38:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:54,966 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-09 00:38:54,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:38:54,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 00:38:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:54,967 INFO L225 Difference]: With dead ends: 35 [2018-12-09 00:38:54,967 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 00:38:54,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:38:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 00:38:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-09 00:38:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:38:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 00:38:54,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-12-09 00:38:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:54,970 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 00:38:54,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:38:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 00:38:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:38:54,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:54,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:54,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:54,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1828195751, now seen corresponding path program 1 times [2018-12-09 00:38:54,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:54,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:55,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:55,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:38:55,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:38:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:38:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:38:55,010 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2018-12-09 00:38:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:55,067 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-09 00:38:55,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:38:55,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-09 00:38:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:55,070 INFO L225 Difference]: With dead ends: 37 [2018-12-09 00:38:55,070 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 00:38:55,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:38:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 00:38:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-12-09 00:38:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 00:38:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-09 00:38:55,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-12-09 00:38:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:55,074 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-09 00:38:55,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:38:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-09 00:38:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:38:55,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:55,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:55,075 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:55,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1828195750, now seen corresponding path program 1 times [2018-12-09 00:38:55,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:55,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:55,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:55,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:38:55,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:38:55,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:38:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:38:55,146 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2018-12-09 00:38:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:55,221 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-09 00:38:55,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:38:55,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-12-09 00:38:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:55,222 INFO L225 Difference]: With dead ends: 36 [2018-12-09 00:38:55,222 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 00:38:55,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:38:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 00:38:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-09 00:38:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 00:38:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-09 00:38:55,224 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2018-12-09 00:38:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:55,225 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-09 00:38:55,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:38:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-09 00:38:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:38:55,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:55,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:55,225 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:55,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:55,226 INFO L82 PathProgramCache]: Analyzing trace with hash 663468183, now seen corresponding path program 1 times [2018-12-09 00:38:55,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:55,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:55,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:55,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:38:55,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:38:55,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:38:55,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:38:55,263 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-12-09 00:38:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:55,289 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-09 00:38:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:38:55,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 00:38:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:55,290 INFO L225 Difference]: With dead ends: 33 [2018-12-09 00:38:55,290 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 00:38:55,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:38:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 00:38:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 00:38:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 00:38:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-09 00:38:55,292 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2018-12-09 00:38:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:55,293 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-09 00:38:55,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:38:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-09 00:38:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:38:55,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:55,293 INFO L402 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] [2018-12-09 00:38:55,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:55,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:55,294 INFO L82 PathProgramCache]: Analyzing trace with hash 245581310, now seen corresponding path program 1 times [2018-12-09 00:38:55,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:55,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:55,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:55,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:38:55,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:38:55,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:38:55,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:38:55,384 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-12-09 00:38:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:55,454 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-09 00:38:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:38:55,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-09 00:38:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:55,454 INFO L225 Difference]: With dead ends: 38 [2018-12-09 00:38:55,455 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 00:38:55,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:38:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 00:38:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 00:38:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 00:38:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-09 00:38:55,456 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-12-09 00:38:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:55,456 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-09 00:38:55,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:38:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-09 00:38:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:38:55,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:55,457 INFO L402 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] [2018-12-09 00:38:55,457 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:55,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1342766592, now seen corresponding path program 1 times [2018-12-09 00:38:55,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:55,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:55,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:38:55,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/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-12-09 00:38:55,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:55,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:38:55,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 00:38:55,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:38:55,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:38:55,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 00:38:55,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 00:38:55,681 INFO L478 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 11 treesize of output 10 [2018-12-09 00:38:55,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:38:55,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:38:55,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:38:55,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 00:38:55,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 00:38:55,718 INFO L478 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 11 treesize of output 10 [2018-12-09 00:38:55,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:38:55,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:38:55,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 00:38:55,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 00:38:55,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-09 00:38:55,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 00:38:55,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:38:55,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 00:38:55,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 00:38:55,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:38:55,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:38:55,886 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-09 00:38:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:55,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:38:55,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-12-09 00:38:55,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 00:38:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 00:38:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:38:55,956 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 20 states. [2018-12-09 00:38:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:58,053 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-12-09 00:38:58,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:38:58,053 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-09 00:38:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:58,053 INFO L225 Difference]: With dead ends: 42 [2018-12-09 00:38:58,053 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 00:38:58,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=691, Unknown=2, NotChecked=0, Total=812 [2018-12-09 00:38:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 00:38:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-12-09 00:38:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 00:38:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 00:38:58,056 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 23 [2018-12-09 00:38:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:58,056 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 00:38:58,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 00:38:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-09 00:38:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:38:58,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:58,056 INFO L402 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] [2018-12-09 00:38:58,057 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:58,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1323993511, now seen corresponding path program 1 times [2018-12-09 00:38:58,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:58,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:58,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:58,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:38:58,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 00:38:58,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:38:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:38:58,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:38:58,121 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-12-09 00:38:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:58,231 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-09 00:38:58,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:38:58,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-12-09 00:38:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:58,232 INFO L225 Difference]: With dead ends: 64 [2018-12-09 00:38:58,232 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 00:38:58,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:38:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 00:38:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-09 00:38:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 00:38:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-12-09 00:38:58,236 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2018-12-09 00:38:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:58,236 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-12-09 00:38:58,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:38:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-09 00:38:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:38:58,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:58,237 INFO L402 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] [2018-12-09 00:38:58,237 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:58,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:58,237 INFO L82 PathProgramCache]: Analyzing trace with hash -264354391, now seen corresponding path program 1 times [2018-12-09 00:38:58,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:58,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:58,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:38:58,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/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-12-09 00:38:58,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:58,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:38:58,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 00:38:58,396 INFO L478 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 11 treesize of output 10 [2018-12-09 00:38:58,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:38:58,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:38:58,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:38:58,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 00:38:58,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 00:38:58,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 00:38:58,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:38:58,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:38:58,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:38:58,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-09 00:38:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:58,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:38:58,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-12-09 00:38:58,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 00:38:58,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 00:38:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:38:58,607 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 20 states. [2018-12-09 00:38:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:38:59,810 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-12-09 00:38:59,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:38:59,810 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-09 00:38:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:38:59,811 INFO L225 Difference]: With dead ends: 83 [2018-12-09 00:38:59,811 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 00:38:59,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2018-12-09 00:38:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 00:38:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2018-12-09 00:38:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 00:38:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-09 00:38:59,814 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-12-09 00:38:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:38:59,814 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-09 00:38:59,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 00:38:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-09 00:38:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:38:59,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:38:59,815 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:38:59,815 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:38:59,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:38:59,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1666919290, now seen corresponding path program 2 times [2018-12-09 00:38:59,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:38:59,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:38:59,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:59,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:38:59,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:38:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:38:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:38:59,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:38:59,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/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-12-09 00:39:00,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:39:00,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:39:00,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:39:00,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:39:00,021 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 00:39:00,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 00:39:00,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:39:00,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:39:00,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:39:00,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 00:39:00,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 00:39:00,061 INFO L478 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 13 treesize of output 12 [2018-12-09 00:39:00,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:39:00,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:39:00,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:39:00,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 00:39:00,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-09 00:39:00,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 00:39:00,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:39:00,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:39:00,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:39:00,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-09 00:39:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:39:00,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:39:00,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-09 00:39:00,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 00:39:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 00:39:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-12-09 00:39:00,315 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 24 states. [2018-12-09 00:39:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:39:01,415 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-12-09 00:39:01,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:39:01,415 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-12-09 00:39:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:39:01,416 INFO L225 Difference]: With dead ends: 82 [2018-12-09 00:39:01,416 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 00:39:01,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 00:39:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 00:39:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 57. [2018-12-09 00:39:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 00:39:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-09 00:39:01,420 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 29 [2018-12-09 00:39:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:39:01,420 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-09 00:39:01,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 00:39:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-09 00:39:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:39:01,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:39:01,421 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:39:01,421 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:39:01,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:39:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1321635786, now seen corresponding path program 2 times [2018-12-09 00:39:01,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:39:01,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:39:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:39:01,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:39:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:39:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:39:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:39:01,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:39:01,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/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-12-09 00:39:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:39:01,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:39:01,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:39:01,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:39:01,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 00:39:01,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 00:39:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 00:39:01,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 00:39:01,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 00:39:01,681 INFO L478 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 13 treesize of output 12 [2018-12-09 00:39:01,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:39:01,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 00:39:01,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 00:39:01,713 INFO L478 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 13 treesize of output 12 [2018-12-09 00:39:01,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 00:39:01,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-12-09 00:39:01,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-09 00:39:01,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-09 00:39:01,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:39:01,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 00:39:01,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 00:39:01,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:39:01,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:39:01,937 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-12-09 00:39:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:39:02,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:39:02,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-12-09 00:39:02,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 00:39:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 00:39:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-12-09 00:39:02,025 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 23 states. [2018-12-09 00:39:03,653 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2018-12-09 00:39:06,931 WARN L180 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2018-12-09 00:39:08,943 WARN L180 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-12-09 00:39:10,324 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-12-09 00:39:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:39:10,357 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-09 00:39:10,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:39:10,357 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-12-09 00:39:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:39:10,357 INFO L225 Difference]: With dead ends: 60 [2018-12-09 00:39:10,357 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:39:10,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 00:39:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:39:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:39:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:39:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:39:10,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-09 00:39:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:39:10,358 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:39:10,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 00:39:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:39:10,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:39:10,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:39:10 BoogieIcfgContainer [2018-12-09 00:39:10,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:39:10,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:39:10,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:39:10,361 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:39:10,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:38:54" (3/4) ... [2018-12-09 00:39:10,364 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:39:10,367 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:39:10,367 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-12-09 00:39:10,367 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 00:39:10,368 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 00:39:10,368 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:39:10,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 00:39:10,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 00:39:10,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:39:10,397 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4c4bc91c-de5a-4c00-9a5b-a549690d22e3/bin-2019/uautomizer/witness.graphml [2018-12-09 00:39:10,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:39:10,398 INFO L168 Benchmark]: Toolchain (without parser) took 16579.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 950.6 MB in the beginning and 918.9 MB in the end (delta: 31.7 MB). Peak memory consumption was 200.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:39:10,399 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:39:10,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:39:10,399 INFO L168 Benchmark]: Boogie Preprocessor took 35.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:39:10,399 INFO L168 Benchmark]: RCFGBuilder took 247.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:39:10,399 INFO L168 Benchmark]: TraceAbstraction took 15971.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 918.9 MB in the end (delta: 133.2 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:39:10,400 INFO L168 Benchmark]: Witness Printer took 36.23 ms. Allocated memory is still 1.2 GB. Free memory is still 918.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:39:10,400 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15971.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 918.9 MB in the end (delta: 133.2 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. * Witness Printer took 36.23 ms. Allocated memory is still 1.2 GB. Free memory is still 918.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 45 locations, 9 error locations. SAFE Result, 15.9s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 382 SDtfs, 666 SDslu, 1655 SDs, 0 SdLazy, 1478 SolverSat, 154 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=13, 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, 15 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 374 ConstructedInterpolants, 39 QuantifiedInterpolants, 98279 SizeOfPredicates, 54 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...