./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/subseq-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_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/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 1ed241b7ea3188deab01745f11227ce75decf7bc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:35:07,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:35:07,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:35:07,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:35:07,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:35:07,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:35:07,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:35:07,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:35:07,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:35:07,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:35:07,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:35:07,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:35:07,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:35:07,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:35:07,313 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:35:07,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:35:07,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:35:07,314 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:35:07,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:35:07,316 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:35:07,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:35:07,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:35:07,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:35:07,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:35:07,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:35:07,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:35:07,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:35:07,320 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:35:07,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:35:07,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:35:07,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:35:07,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:35:07,322 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:35:07,322 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:35:07,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:35:07,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:35:07,323 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 12:35:07,330 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:35:07,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:35:07,331 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:35:07,331 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:35:07,331 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:35:07,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:35:07,332 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:35:07,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:35:07,332 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:35:07,332 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 12:35:07,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:35:07,332 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:35:07,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:35:07,333 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 12:35:07,333 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 12:35:07,333 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 12:35:07,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:35:07,333 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:35:07,333 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:35:07,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:35:07,334 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:35:07,334 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:35:07,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:35:07,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:35:07,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:35:07,335 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:35:07,335 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:35:07,335 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:35:07,335 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_97622a5b-8086-4b06-a3e2-189d4e46fa26/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 -> 1ed241b7ea3188deab01745f11227ce75decf7bc [2018-12-09 12:35:07,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:35:07,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:35:07,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:35:07,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:35:07,367 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:35:07,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-12-09 12:35:07,402 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/data/79ac3ec82/c959fcd8428f432091f5ee5baad92463/FLAGaf7dc2cf6 [2018-12-09 12:35:07,827 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:35:07,828 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-12-09 12:35:07,834 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/data/79ac3ec82/c959fcd8428f432091f5ee5baad92463/FLAGaf7dc2cf6 [2018-12-09 12:35:07,843 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/data/79ac3ec82/c959fcd8428f432091f5ee5baad92463 [2018-12-09 12:35:07,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:35:07,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 12:35:07,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:35:07,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:35:07,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:35:07,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:35:07" (1/1) ... [2018-12-09 12:35:07,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178df10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:07, skipping insertion in model container [2018-12-09 12:35:07,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:35:07" (1/1) ... [2018-12-09 12:35:07,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:35:07,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:35:08,030 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:35:08,068 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:35:08,097 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:35:08,119 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:35:08,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08 WrapperNode [2018-12-09 12:35:08,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:35:08,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:35:08,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:35:08,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:35:08,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... [2018-12-09 12:35:08,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... [2018-12-09 12:35:08,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... [2018-12-09 12:35:08,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... [2018-12-09 12:35:08,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... [2018-12-09 12:35:08,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... [2018-12-09 12:35:08,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... [2018-12-09 12:35:08,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:35:08,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:35:08,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:35:08,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:35:08,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/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 12:35:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:35:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:35:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 12:35:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 12:35:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure subseq [2018-12-09 12:35:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 12:35:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 12:35:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 12:35:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 12:35:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 12:35:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 12:35:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 12:35:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 12:35:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 12:35:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 12:35:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 12:35:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 12:35:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 12:35:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 12:35:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 12:35:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 12:35:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure subseq [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:35:08,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:35:08,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:35:08,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:35:08,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:35:08,408 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:35:08,408 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 12:35:08,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:35:08 BoogieIcfgContainer [2018-12-09 12:35:08,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:35:08,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:35:08,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:35:08,411 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:35:08,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:35:07" (1/3) ... [2018-12-09 12:35:08,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760be8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:35:08, skipping insertion in model container [2018-12-09 12:35:08,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:08" (2/3) ... [2018-12-09 12:35:08,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760be8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:35:08, skipping insertion in model container [2018-12-09 12:35:08,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:35:08" (3/3) ... [2018-12-09 12:35:08,414 INFO L112 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-12-09 12:35:08,419 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:35:08,424 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 12:35:08,436 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 12:35:08,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:35:08,451 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:35:08,451 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 12:35:08,451 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:35:08,451 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:35:08,451 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:35:08,452 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:35:08,452 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:35:08,452 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:35:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-09 12:35:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 12:35:08,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:08,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:08,467 INFO L423 AbstractCegarLoop]: === Iteration 1 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:08,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash 364110360, now seen corresponding path program 1 times [2018-12-09 12:35:08,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:08,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:08,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:08,577 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 12:35:08,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:08,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:35:08,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:35:08,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:35:08,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:35:08,590 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-09 12:35:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:08,622 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-09 12:35:08,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:35:08,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 12:35:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:08,628 INFO L225 Difference]: With dead ends: 46 [2018-12-09 12:35:08,628 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 12:35:08,629 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 12:35:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 12:35:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 12:35:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 12:35:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 12:35:08,649 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2018-12-09 12:35:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:08,649 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 12:35:08,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:35:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 12:35:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 12:35:08,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:08,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:08,650 INFO L423 AbstractCegarLoop]: === Iteration 2 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:08,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 364110361, now seen corresponding path program 1 times [2018-12-09 12:35:08,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:08,692 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 12:35:08,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:08,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:35:08,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:35:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:35:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:35:08,694 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-09 12:35:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:08,708 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-09 12:35:08,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:35:08,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 12:35:08,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:08,709 INFO L225 Difference]: With dead ends: 42 [2018-12-09 12:35:08,709 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 12:35:08,709 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 12:35:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 12:35:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 12:35:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 12:35:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 12:35:08,712 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-09 12:35:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:08,712 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 12:35:08,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:35:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 12:35:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 12:35:08,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:08,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:08,713 INFO L423 AbstractCegarLoop]: === Iteration 3 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:08,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480737, now seen corresponding path program 1 times [2018-12-09 12:35:08,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:08,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:08,730 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 12:35:08,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:08,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:35:08,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:35:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:35:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:35:08,731 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-09 12:35:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:08,758 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-09 12:35:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:35:08,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 12:35:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:08,758 INFO L225 Difference]: With dead ends: 41 [2018-12-09 12:35:08,758 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 12:35:08,759 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 12:35:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 12:35:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 12:35:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 12:35:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-09 12:35:08,761 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2018-12-09 12:35:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:08,761 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-09 12:35:08,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:35:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-09 12:35:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 12:35:08,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:08,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:08,762 INFO L423 AbstractCegarLoop]: === Iteration 4 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:08,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480736, now seen corresponding path program 1 times [2018-12-09 12:35:08,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:08,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:08,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:08,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:08,799 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 12:35:08,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:08,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:35:08,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:35:08,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:35:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:35:08,800 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-12-09 12:35:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:08,814 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 12:35:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:35:08,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 12:35:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:08,815 INFO L225 Difference]: With dead ends: 40 [2018-12-09 12:35:08,815 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 12:35:08,815 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 12:35:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 12:35:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 12:35:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 12:35:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 12:35:08,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2018-12-09 12:35:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:08,817 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 12:35:08,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:35:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 12:35:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 12:35:08,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:08,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:08,818 INFO L423 AbstractCegarLoop]: === Iteration 5 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:08,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1984019961, now seen corresponding path program 1 times [2018-12-09 12:35:08,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:08,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:08,839 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 12:35:08,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:08,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:35:08,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:35:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:35:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:35:08,840 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-12-09 12:35:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:08,881 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-09 12:35:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:35:08,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 12:35:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:08,882 INFO L225 Difference]: With dead ends: 38 [2018-12-09 12:35:08,882 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 12:35:08,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:35:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 12:35:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 12:35:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 12:35:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-09 12:35:08,886 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2018-12-09 12:35:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:08,886 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-09 12:35:08,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:35:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-09 12:35:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 12:35:08,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:08,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:08,886 INFO L423 AbstractCegarLoop]: === Iteration 6 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:08,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1984019962, now seen corresponding path program 1 times [2018-12-09 12:35:08,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:08,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:08,930 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 12:35:08,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:08,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:35:08,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:35:08,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:35:08,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:35:08,930 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-12-09 12:35:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:08,995 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-12-09 12:35:08,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:35:08,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 12:35:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:08,998 INFO L225 Difference]: With dead ends: 58 [2018-12-09 12:35:08,998 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 12:35:08,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:35:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 12:35:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-12-09 12:35:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 12:35:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-12-09 12:35:09,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 14 [2018-12-09 12:35:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:09,002 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-12-09 12:35:09,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:35:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-12-09 12:35:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 12:35:09,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:09,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:09,002 INFO L423 AbstractCegarLoop]: === Iteration 7 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:09,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1401263346, now seen corresponding path program 1 times [2018-12-09 12:35:09,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:09,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:09,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:09,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:09,024 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 12:35:09,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:09,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:35:09,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:35:09,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:35:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:35:09,025 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 5 states. [2018-12-09 12:35:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:09,063 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-12-09 12:35:09,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:35:09,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 12:35:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:09,064 INFO L225 Difference]: With dead ends: 45 [2018-12-09 12:35:09,064 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 12:35:09,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:35:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 12:35:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 12:35:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 12:35:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-12-09 12:35:09,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 17 [2018-12-09 12:35:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:09,067 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-12-09 12:35:09,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:35:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-12-09 12:35:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 12:35:09,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:09,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:09,067 INFO L423 AbstractCegarLoop]: === Iteration 8 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:09,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1401263345, now seen corresponding path program 1 times [2018-12-09 12:35:09,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:09,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:09,106 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 12:35:09,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:09,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:35:09,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:35:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:35:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:35:09,107 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 7 states. [2018-12-09 12:35:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:09,160 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-12-09 12:35:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:35:09,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 12:35:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:09,160 INFO L225 Difference]: With dead ends: 60 [2018-12-09 12:35:09,160 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 12:35:09,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:35:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 12:35:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-12-09 12:35:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 12:35:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-12-09 12:35:09,163 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-12-09 12:35:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:09,163 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-12-09 12:35:09,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:35:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-12-09 12:35:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 12:35:09,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:09,164 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 12:35:09,164 INFO L423 AbstractCegarLoop]: === Iteration 9 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:09,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash 262199082, now seen corresponding path program 1 times [2018-12-09 12:35:09,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:09,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:09,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:35:09,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:35:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:35:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:35:09,181 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2018-12-09 12:35:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:09,188 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-12-09 12:35:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:35:09,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 12:35:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:09,190 INFO L225 Difference]: With dead ends: 57 [2018-12-09 12:35:09,190 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 12:35:09,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:35:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 12:35:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-09 12:35:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 12:35:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-12-09 12:35:09,193 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2018-12-09 12:35:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:09,194 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-12-09 12:35:09,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:35:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-12-09 12:35:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:35:09,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:09,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:09,195 INFO L423 AbstractCegarLoop]: === Iteration 10 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:09,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1761616738, now seen corresponding path program 1 times [2018-12-09 12:35:09,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:09,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:09,233 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 12:35:09,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:09,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:35:09,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:35:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:35:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:35:09,234 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-12-09 12:35:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:09,273 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-12-09 12:35:09,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:35:09,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-09 12:35:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:09,274 INFO L225 Difference]: With dead ends: 55 [2018-12-09 12:35:09,274 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 12:35:09,274 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 12:35:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 12:35:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 12:35:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 12:35:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-12-09 12:35:09,276 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23 [2018-12-09 12:35:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:09,277 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-12-09 12:35:09,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:35:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-12-09 12:35:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 12:35:09,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:09,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:09,277 INFO L423 AbstractCegarLoop]: === Iteration 11 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:09,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -685750361, now seen corresponding path program 1 times [2018-12-09 12:35:09,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:09,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:35:09,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:35:09,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:35:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:35:09,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:35:09,370 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 9 states. [2018-12-09 12:35:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:09,451 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-12-09 12:35:09,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:35:09,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-09 12:35:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:09,451 INFO L225 Difference]: With dead ends: 57 [2018-12-09 12:35:09,451 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 12:35:09,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:35:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 12:35:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 12:35:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 12:35:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-12-09 12:35:09,454 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 24 [2018-12-09 12:35:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:09,454 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-12-09 12:35:09,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:35:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-12-09 12:35:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 12:35:09,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:09,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:09,455 INFO L423 AbstractCegarLoop]: === Iteration 12 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:09,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1615072229, now seen corresponding path program 1 times [2018-12-09 12:35:09,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:09,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:09,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:35:09,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/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 12:35:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:09,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:35:09,656 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 11 treesize of output 8 [2018-12-09 12:35:09,658 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 8 treesize of output 7 [2018-12-09 12:35:09,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:09,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:09,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:09,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 12:35:09,694 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 15 treesize of output 11 [2018-12-09 12:35:09,696 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 11 treesize of output 3 [2018-12-09 12:35:09,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:09,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:09,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:09,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-09 12:35:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 12:35:09,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2018-12-09 12:35:09,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 12:35:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 12:35:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:35:09,746 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 17 states. [2018-12-09 12:35:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:10,220 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-12-09 12:35:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 12:35:10,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-12-09 12:35:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:10,220 INFO L225 Difference]: With dead ends: 79 [2018-12-09 12:35:10,220 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 12:35:10,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 12:35:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 12:35:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-12-09 12:35:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 12:35:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2018-12-09 12:35:10,223 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2018-12-09 12:35:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:10,223 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-12-09 12:35:10,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 12:35:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2018-12-09 12:35:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 12:35:10,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:10,224 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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 12:35:10,224 INFO L423 AbstractCegarLoop]: === Iteration 13 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:10,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1575452162, now seen corresponding path program 1 times [2018-12-09 12:35:10,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:10,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:10,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:10,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:35:10,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/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 12:35:10,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:10,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:35:10,405 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 12:35:10,407 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 12:35:10,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:10,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:10,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 12:35:10,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 12:35:10,492 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 18 treesize of output 14 [2018-12-09 12:35:10,500 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 14 treesize of output 11 [2018-12-09 12:35:10,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 12:35:10,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 12:35:10,512 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 12:35:10,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 12:35:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:10,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:35:10,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2018-12-09 12:35:10,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 12:35:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 12:35:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-12-09 12:35:10,618 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 20 states. [2018-12-09 12:35:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:12,127 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-12-09 12:35:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 12:35:12,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-12-09 12:35:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:12,127 INFO L225 Difference]: With dead ends: 84 [2018-12-09 12:35:12,127 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 12:35:12,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2018-12-09 12:35:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 12:35:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-12-09 12:35:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 12:35:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2018-12-09 12:35:12,131 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 27 [2018-12-09 12:35:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:12,131 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2018-12-09 12:35:12,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 12:35:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-12-09 12:35:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 12:35:12,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:12,131 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:35:12,131 INFO L423 AbstractCegarLoop]: === Iteration 14 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:12,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1862759084, now seen corresponding path program 1 times [2018-12-09 12:35:12,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:12,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:12,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:12,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:12,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:12,327 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 12:35:12,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:35:12,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/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 12:35:12,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:12,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:35:12,360 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 12:35:12,362 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 12:35:12,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,372 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 12:35:12,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 12:35:12,389 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 15 treesize of output 12 [2018-12-09 12:35:12,390 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 12 treesize of output 11 [2018-12-09 12:35:12,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 12:35:12,418 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 28 treesize of output 29 [2018-12-09 12:35:12,420 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 12:35:12,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:12,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 12:35:12,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 12:35:14,659 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 12:35:14,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-12-09 12:35:14,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2018-12-09 12:35:14,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-09 12:35:14,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-12-09 12:35:14,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-09 12:35:14,906 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 39 treesize of output 29 [2018-12-09 12:35:14,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:14,908 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 38 treesize of output 28 [2018-12-09 12:35:14,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:14,909 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 34 treesize of output 24 [2018-12-09 12:35:14,910 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:14,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-12-09 12:35:14,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:15,037 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 44 treesize of output 42 [2018-12-09 12:35:15,038 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 12:35:15,108 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 32 treesize of output 30 [2018-12-09 12:35:15,109 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 12:35:15,159 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 38 treesize of output 31 [2018-12-09 12:35:15,160 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:15,161 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 33 treesize of output 26 [2018-12-09 12:35:15,161 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:15,204 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 31 treesize of output 21 [2018-12-09 12:35:15,204 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:15,205 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 26 treesize of output 16 [2018-12-09 12:35:15,206 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:15,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 12:35:15,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 12:35:15,294 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-12-09 12:35:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:15,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:35:15,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 23 [2018-12-09 12:35:15,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 12:35:15,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 12:35:15,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-09 12:35:15,368 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 24 states. [2018-12-09 12:35:20,900 WARN L180 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-12-09 12:35:21,222 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-12-09 12:35:27,217 WARN L180 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-09 12:35:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:27,450 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-12-09 12:35:27,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 12:35:27,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-12-09 12:35:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:27,450 INFO L225 Difference]: With dead ends: 92 [2018-12-09 12:35:27,450 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 12:35:27,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=343, Invalid=1548, Unknown=1, NotChecked=0, Total=1892 [2018-12-09 12:35:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 12:35:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 46. [2018-12-09 12:35:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 12:35:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-12-09 12:35:27,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 34 [2018-12-09 12:35:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:27,453 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-12-09 12:35:27,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 12:35:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-12-09 12:35:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 12:35:27,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:35:27,453 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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 12:35:27,453 INFO L423 AbstractCegarLoop]: === Iteration 15 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 12:35:27,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:35:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1816536437, now seen corresponding path program 2 times [2018-12-09 12:35:27,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:35:27,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:35:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:35:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:35:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:35:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:27,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:35:27,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/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 12:35:27,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 12:35:27,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 12:35:27,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:35:27,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:35:27,747 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 12:35:27,759 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 12:35:27,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 12:35:27,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 12:35:27,775 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 12:35:27,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 12:35:27,790 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 12:35:27,792 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 12:35:27,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:35:27,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:27,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:35:27,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 12:35:27,896 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 12:35:27,902 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 12:35:27,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 12:35:27,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 12:35:27,913 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 12:35:27,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-09 12:35:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:35:27,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:35:27,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-12-09 12:35:27,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 12:35:27,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 12:35:27,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:35:27,989 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 22 states. [2018-12-09 12:35:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:35:28,811 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-09 12:35:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 12:35:28,811 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-12-09 12:35:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:35:28,811 INFO L225 Difference]: With dead ends: 45 [2018-12-09 12:35:28,811 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 12:35:28,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 12:35:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 12:35:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 12:35:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 12:35:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 12:35:28,812 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-09 12:35:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:35:28,813 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:35:28,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 12:35:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 12:35:28,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 12:35:28,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:35:28 BoogieIcfgContainer [2018-12-09 12:35:28,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:35:28,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:35:28,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:35:28,817 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:35:28,817 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:35:08" (3/4) ... [2018-12-09 12:35:28,819 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 12:35:28,823 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 12:35:28,823 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure subseq [2018-12-09 12:35:28,823 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 12:35:28,823 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 12:35:28,823 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 12:35:28,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 12:35:28,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 12:35:28,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 12:35:28,855 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_97622a5b-8086-4b06-a3e2-189d4e46fa26/bin-2019/uautomizer/witness.graphml [2018-12-09 12:35:28,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:35:28,855 INFO L168 Benchmark]: Toolchain (without parser) took 21009.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:35:28,856 INFO L168 Benchmark]: CDTParser took 0.11 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 12:35:28,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:35:28,856 INFO L168 Benchmark]: Boogie Preprocessor took 28.34 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 12:35:28,856 INFO L168 Benchmark]: RCFGBuilder took 259.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:35:28,856 INFO L168 Benchmark]: TraceAbstraction took 20407.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -104.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:35:28,856 INFO L168 Benchmark]: Witness Printer took 38.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:35:28,857 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.11 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 273.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.34 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 259.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20407.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -104.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 38.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: 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: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: 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: 544]: 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: 550]: 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: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: 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: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 15 error locations. SAFE Result, 20.3s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 954 SDslu, 1440 SDs, 0 SdLazy, 1891 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred 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, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 398 ConstructedInterpolants, 41 QuantifiedInterpolants, 120321 SizeOfPredicates, 41 NumberOfNonLiveVariables, 622 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 15/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...