./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/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 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 15:14:01,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:14:01,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:14:01,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:14:01,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:14:01,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:14:01,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:14:01,214 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:14:01,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:14:01,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:14:01,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:14:01,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:14:01,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:14:01,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:14:01,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:14:01,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:14:01,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:14:01,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:14:01,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:14:01,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:14:01,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:14:01,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:14:01,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:14:01,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:14:01,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:14:01,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:14:01,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:14:01,225 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:14:01,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:14:01,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:14:01,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:14:01,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:14:01,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:14:01,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:14:01,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:14:01,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:14:01,228 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 15:14:01,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:14:01,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:14:01,236 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 15:14:01,236 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 15:14:01,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:14:01,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:14:01,237 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:14:01,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:14:01,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:14:01,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 15:14:01,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:14:01,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:14:01,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:14:01,238 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 15:14:01,238 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 15:14:01,238 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 15:14:01,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 15:14:01,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:14:01,238 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:14:01,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:14:01,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:14:01,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 15:14:01,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 15:14:01,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 15:14:01,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:14:01,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 15:14:01,239 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:14:01,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 15:14:01,240 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_228c84c3-9304-4b94-a8f5-0383dd6ec047/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 -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-12-01 15:14:01,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:14:01,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:14:01,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:14:01,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:14:01,267 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:14:01,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-01 15:14:01,303 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/data/83da63ba4/a8e8aebc2df94fdc8a7defe5240f3a98/FLAG87bbdf726 [2018-12-01 15:14:01,783 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:14:01,783 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-01 15:14:01,790 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/data/83da63ba4/a8e8aebc2df94fdc8a7defe5240f3a98/FLAG87bbdf726 [2018-12-01 15:14:02,288 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/data/83da63ba4/a8e8aebc2df94fdc8a7defe5240f3a98 [2018-12-01 15:14:02,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:14:02,291 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 15:14:02,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:14:02,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:14:02,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:14:02,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495e205e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02, skipping insertion in model container [2018-12-01 15:14:02,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:14:02,328 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:14:02,468 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:14:02,474 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:14:02,537 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:14:02,564 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:14:02,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02 WrapperNode [2018-12-01 15:14:02,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:14:02,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:14:02,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:14:02,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:14:02,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... [2018-12-01 15:14:02,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:14:02,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:14:02,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:14:02,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:14:02,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/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-01 15:14:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 15:14:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:14:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-01 15:14:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-01 15:14:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-12-01 15:14:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 15:14:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-01 15:14:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-01 15:14:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 15:14:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 15:14:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 15:14:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 15:14:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 15:14:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 15:14:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 15:14:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 15:14:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 15:14:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 15:14:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 15:14:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 15:14:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 15:14:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 15:14:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 15:14:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 15:14:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 15:14:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 15:14:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 15:14:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 15:14:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 15:14:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 15:14:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 15:14:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 15:14:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:14:02,892 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:14:02,892 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-01 15:14:02,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:14:02 BoogieIcfgContainer [2018-12-01 15:14:02,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:14:02,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 15:14:02,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 15:14:02,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 15:14:02,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:14:02" (1/3) ... [2018-12-01 15:14:02,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b83fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:14:02, skipping insertion in model container [2018-12-01 15:14:02,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:14:02" (2/3) ... [2018-12-01 15:14:02,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b83fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:14:02, skipping insertion in model container [2018-12-01 15:14:02,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:14:02" (3/3) ... [2018-12-01 15:14:02,897 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-01 15:14:02,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 15:14:02,910 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-01 15:14:02,924 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-01 15:14:02,940 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:14:02,941 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 15:14:02,941 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 15:14:02,941 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 15:14:02,941 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:14:02,941 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:14:02,941 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 15:14:02,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:14:02,941 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 15:14:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-01 15:14:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 15:14:02,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:02,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:02,959 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:02,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598342, now seen corresponding path program 1 times [2018-12-01 15:14:02,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:02,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:02,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,059 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-01 15:14:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:14:03,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:14:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:14:03,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:14:03,072 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-01 15:14:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,106 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-01 15:14:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:14:03,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-01 15:14:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,112 INFO L225 Difference]: With dead ends: 48 [2018-12-01 15:14:03,113 INFO L226 Difference]: Without dead ends: 45 [2018-12-01 15:14:03,114 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-01 15:14:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-01 15:14:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-01 15:14:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-01 15:14:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-01 15:14:03,134 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-01 15:14:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,134 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-01 15:14:03,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:14:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-01 15:14:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 15:14:03,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:03,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598343, now seen corresponding path program 1 times [2018-12-01 15:14:03,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,181 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-01 15:14:03,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:14:03,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:14:03,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:14:03,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:14:03,182 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-01 15:14:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,197 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-01 15:14:03,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:14:03,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-01 15:14:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,198 INFO L225 Difference]: With dead ends: 44 [2018-12-01 15:14:03,198 INFO L226 Difference]: Without dead ends: 44 [2018-12-01 15:14:03,199 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-01 15:14:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-01 15:14:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-01 15:14:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 15:14:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-01 15:14:03,202 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-01 15:14:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,202 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-01 15:14:03,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:14:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-01 15:14:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 15:14:03,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:03,203 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993495, now seen corresponding path program 1 times [2018-12-01 15:14:03,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,227 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-01 15:14:03,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:14:03,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:14:03,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:14:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:14:03,228 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-12-01 15:14:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,243 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-01 15:14:03,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:14:03,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 15:14:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,244 INFO L225 Difference]: With dead ends: 43 [2018-12-01 15:14:03,244 INFO L226 Difference]: Without dead ends: 43 [2018-12-01 15:14:03,244 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-01 15:14:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-01 15:14:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-01 15:14:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-01 15:14:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-01 15:14:03,247 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-01 15:14:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,247 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-01 15:14:03,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:14:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-01 15:14:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 15:14:03,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:03,248 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993494, now seen corresponding path program 1 times [2018-12-01 15:14:03,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,276 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-01 15:14:03,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:14:03,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:14:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:14:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:14:03,276 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-01 15:14:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,284 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-01 15:14:03,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:14:03,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-01 15:14:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,285 INFO L225 Difference]: With dead ends: 42 [2018-12-01 15:14:03,285 INFO L226 Difference]: Without dead ends: 42 [2018-12-01 15:14:03,285 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-01 15:14:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-01 15:14:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-01 15:14:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-01 15:14:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-01 15:14:03,288 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-01 15:14:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,288 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-01 15:14:03,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:14:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-01 15:14:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 15:14:03,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:03,288 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525834, now seen corresponding path program 1 times [2018-12-01 15:14:03,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,314 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-01 15:14:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 15:14:03,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:14:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:14:03,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:14:03,315 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-01 15:14:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,355 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-01 15:14:03,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:14:03,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-01 15:14:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,356 INFO L225 Difference]: With dead ends: 40 [2018-12-01 15:14:03,356 INFO L226 Difference]: Without dead ends: 40 [2018-12-01 15:14:03,356 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-01 15:14:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-01 15:14:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-01 15:14:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 15:14:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-01 15:14:03,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-01 15:14:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,360 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-01 15:14:03,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:14:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-01 15:14:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 15:14:03,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:03,361 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525833, now seen corresponding path program 1 times [2018-12-01 15:14:03,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,423 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-01 15:14:03,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:14:03,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:14:03,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:14:03,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:14:03,424 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-01 15:14:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,489 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-01 15:14:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:14:03,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-01 15:14:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,491 INFO L225 Difference]: With dead ends: 62 [2018-12-01 15:14:03,491 INFO L226 Difference]: Without dead ends: 62 [2018-12-01 15:14:03,491 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-01 15:14:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-01 15:14:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-01 15:14:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-01 15:14:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-01 15:14:03,495 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-01 15:14:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,495 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-01 15:14:03,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:14:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-01 15:14:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 15:14:03,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:03,496 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279356, now seen corresponding path program 1 times [2018-12-01 15:14:03,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,526 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-01 15:14:03,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:14:03,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:14:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:14:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:14:03,528 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-01 15:14:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,579 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-01 15:14:03,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:14:03,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-01 15:14:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,580 INFO L225 Difference]: With dead ends: 43 [2018-12-01 15:14:03,580 INFO L226 Difference]: Without dead ends: 43 [2018-12-01 15:14:03,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:14:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-01 15:14:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-01 15:14:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 15:14:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-01 15:14:03,583 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-01 15:14:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,583 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-01 15:14:03,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:14:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-01 15:14:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 15:14:03,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:03,584 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279357, now seen corresponding path program 1 times [2018-12-01 15:14:03,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,633 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-01 15:14:03,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:14:03,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 15:14:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 15:14:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:14:03,634 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-01 15:14:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,702 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-01 15:14:03,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:14:03,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-01 15:14:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,703 INFO L225 Difference]: With dead ends: 55 [2018-12-01 15:14:03,703 INFO L226 Difference]: Without dead ends: 55 [2018-12-01 15:14:03,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:14:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-01 15:14:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-01 15:14:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-01 15:14:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-01 15:14:03,706 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-01 15:14:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,706 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-01 15:14:03,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 15:14:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-01 15:14:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 15:14:03,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,707 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] [2018-12-01 15:14:03,707 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1894101213, now seen corresponding path program 1 times [2018-12-01 15:14:03,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,736 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-01 15:14:03,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:14:03,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:14:03,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:14:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:14:03,737 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-01 15:14:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,779 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-01 15:14:03,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:14:03,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-01 15:14:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,780 INFO L225 Difference]: With dead ends: 46 [2018-12-01 15:14:03,780 INFO L226 Difference]: Without dead ends: 41 [2018-12-01 15:14:03,780 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-01 15:14:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-01 15:14:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-01 15:14:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-01 15:14:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-01 15:14:03,782 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-01 15:14:03,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,782 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-01 15:14:03,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:14:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-01 15:14:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 15:14:03,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,782 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-01 15:14:03,783 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash 197301268, now seen corresponding path program 1 times [2018-12-01 15:14:03,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,797 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-01 15:14:03,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:14:03,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:14:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:14:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:14:03,798 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-01 15:14:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,802 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-01 15:14:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:14:03,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-01 15:14:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,803 INFO L225 Difference]: With dead ends: 43 [2018-12-01 15:14:03,803 INFO L226 Difference]: Without dead ends: 43 [2018-12-01 15:14:03,803 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-01 15:14:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-01 15:14:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-01 15:14:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-01 15:14:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-01 15:14:03,805 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-01 15:14:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,805 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-01 15:14:03,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:14:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-01 15:14:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 15:14:03,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,806 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-01 15:14:03,806 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash 622097713, now seen corresponding path program 1 times [2018-12-01 15:14:03,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:03,893 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-01 15:14:03,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:03,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 15:14:03,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 15:14:03,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 15:14:03,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:14:03,894 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2018-12-01 15:14:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:03,992 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-12-01 15:14:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:14:03,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-01 15:14:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:03,992 INFO L225 Difference]: With dead ends: 64 [2018-12-01 15:14:03,992 INFO L226 Difference]: Without dead ends: 64 [2018-12-01 15:14:03,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 15:14:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-01 15:14:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-01 15:14:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-01 15:14:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-12-01 15:14:03,995 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2018-12-01 15:14:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:03,995 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-12-01 15:14:03,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 15:14:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-12-01 15:14:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 15:14:03,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:03,996 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-01 15:14:03,996 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:03,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:03,996 INFO L82 PathProgramCache]: Analyzing trace with hash -966250189, now seen corresponding path program 1 times [2018-12-01 15:14:03,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:03,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:03,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:04,141 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-01 15:14:04,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:14:04,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/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-01 15:14:04,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:04,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:14:04,201 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-01 15:14:04,203 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-01 15:14:04,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:04,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:04,210 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-01 15:14:04,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-01 15:14:04,339 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-01 15:14:04,347 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-01 15:14:04,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:04,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:14:04,375 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-01 15:14:04,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-01 15:14:04,475 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-01 15:14:04,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:14:04,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-01 15:14:04,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-01 15:14:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-01 15:14:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-01 15:14:04,495 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2018-12-01 15:14:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:05,090 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-12-01 15:14:05,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 15:14:05,091 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-01 15:14:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:05,092 INFO L225 Difference]: With dead ends: 86 [2018-12-01 15:14:05,092 INFO L226 Difference]: Without dead ends: 86 [2018-12-01 15:14:05,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-01 15:14:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-01 15:14:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-12-01 15:14:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 15:14:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-12-01 15:14:05,095 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 24 [2018-12-01 15:14:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:05,095 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-12-01 15:14:05,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-01 15:14:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-12-01 15:14:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 15:14:05,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:05,096 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, 1] [2018-12-01 15:14:05,096 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:05,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:05,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2009352802, now seen corresponding path program 1 times [2018-12-01 15:14:05,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:05,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:05,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:05,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:05,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:05,140 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-01 15:14:05,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:14:05,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 15:14:05,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 15:14:05,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 15:14:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:14:05,140 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 10 states. [2018-12-01 15:14:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:05,253 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-12-01 15:14:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 15:14:05,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-01 15:14:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:05,253 INFO L225 Difference]: With dead ends: 69 [2018-12-01 15:14:05,253 INFO L226 Difference]: Without dead ends: 51 [2018-12-01 15:14:05,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-01 15:14:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-01 15:14:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-01 15:14:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 15:14:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-12-01 15:14:05,255 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2018-12-01 15:14:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:05,255 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-12-01 15:14:05,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 15:14:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-12-01 15:14:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 15:14:05,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:05,256 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, 1, 1, 1] [2018-12-01 15:14:05,256 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:05,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash -689762273, now seen corresponding path program 1 times [2018-12-01 15:14:05,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:05,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:05,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:05,439 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-01 15:14:05,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:14:05,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/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-01 15:14:05,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:05,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:14:05,464 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-01 15:14:05,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:05,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:05,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-01 15:14:05,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-01 15:14:05,481 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-01 15:14:05,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:05,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:05,487 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-01 15:14:05,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-01 15:14:05,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-01 15:14:05,512 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-01 15:14:05,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:05,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:05,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:14:05,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-01 15:14:08,358 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-01 15:14:08,428 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 43 treesize of output 53 [2018-12-01 15:14:08,432 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 45 treesize of output 38 [2018-12-01 15:14:08,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:08,472 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 37 treesize of output 29 [2018-12-01 15:14:08,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:08,515 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 26 [2018-12-01 15:14:08,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:08,550 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 29 treesize of output 27 [2018-12-01 15:14:08,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:08,590 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 26 treesize of output 24 [2018-12-01 15:14:08,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:08,641 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 37 treesize of output 43 [2018-12-01 15:14:08,642 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-01 15:14:08,716 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 33 treesize of output 49 [2018-12-01 15:14:08,717 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-01 15:14:08,792 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 26 [2018-12-01 15:14:08,793 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:08,795 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 35 treesize of output 27 [2018-12-01 15:14:08,795 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:08,796 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 23 [2018-12-01 15:14:08,797 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:08,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-01 15:14:08,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 15:14:08,883 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-01 15:14:08,950 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-01 15:14:08,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:14:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2018-12-01 15:14:08,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-01 15:14:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-01 15:14:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-12-01 15:14:08,966 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 28 states. [2018-12-01 15:14:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:11,488 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-12-01 15:14:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 15:14:11,489 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-01 15:14:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:11,489 INFO L225 Difference]: With dead ends: 109 [2018-12-01 15:14:11,489 INFO L226 Difference]: Without dead ends: 109 [2018-12-01 15:14:11,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=261, Invalid=1460, Unknown=1, NotChecked=0, Total=1722 [2018-12-01 15:14:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-01 15:14:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-12-01 15:14:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-01 15:14:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-12-01 15:14:11,493 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 27 [2018-12-01 15:14:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:11,493 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-12-01 15:14:11,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-01 15:14:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-12-01 15:14:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 15:14:11,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:11,494 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:11,494 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:11,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1181155673, now seen corresponding path program 2 times [2018-12-01 15:14:11,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:11,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:11,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:14:11,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:14:11,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/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-01 15:14:11,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:14:11,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 15:14:11,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:14:11,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:14:11,690 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-01 15:14:11,702 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-01 15:14:11,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:11,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:14:11,713 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-01 15:14:11,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-01 15:14:11,725 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-01 15:14:11,726 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-01 15:14:11,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:11,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:11,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:11,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-01 15:14:11,827 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-01 15:14:11,831 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-01 15:14:11,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:11,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:14:11,841 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-01 15:14:11,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-01 15:14:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:14:11,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:14:11,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-01 15:14:11,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 15:14:11,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 15:14:11,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-01 15:14:11,930 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 21 states. [2018-12-01 15:14:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:12,727 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-12-01 15:14:12,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 15:14:12,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-01 15:14:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:12,727 INFO L225 Difference]: With dead ends: 92 [2018-12-01 15:14:12,727 INFO L226 Difference]: Without dead ends: 90 [2018-12-01 15:14:12,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 15:14:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-01 15:14:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-12-01 15:14:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 15:14:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-01 15:14:12,730 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 30 [2018-12-01 15:14:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:12,730 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-01 15:14:12,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 15:14:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-01 15:14:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 15:14:12,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:12,730 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:12,731 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:12,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:12,731 INFO L82 PathProgramCache]: Analyzing trace with hash 19179001, now seen corresponding path program 2 times [2018-12-01 15:14:12,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:12,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:12,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:12,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:14:12,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:14:12,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:14:12,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/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-01 15:14:12,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:14:12,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 15:14:12,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:14:12,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:14:12,952 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-01 15:14:12,955 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-01 15:14:12,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:12,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:12,979 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-01 15:14:12,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:12,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:12,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-12-01 15:14:13,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 15:14:13,010 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-01 15:14:13,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:13,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:13,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:13,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-01 15:14:13,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-01 15:14:13,040 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-01 15:14:13,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:13,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:13,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:13,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-12-01 15:14:13,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-01 15:14:13,423 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-01 15:14:13,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:13,434 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 21 treesize of output 13 [2018-12-01 15:14:13,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:13,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:14:13,452 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 2 xjuncts. [2018-12-01 15:14:13,452 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-12-01 15:14:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:14:13,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:14:13,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 26 [2018-12-01 15:14:13,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-01 15:14:13,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-01 15:14:13,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-12-01 15:14:13,608 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 27 states. [2018-12-01 15:14:15,043 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-12-01 15:14:15,235 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-12-01 15:14:15,753 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-12-01 15:14:16,158 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2018-12-01 15:14:17,363 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-12-01 15:14:17,550 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-12-01 15:14:17,770 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-12-01 15:14:17,963 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-12-01 15:14:18,216 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2018-12-01 15:14:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:18,489 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-12-01 15:14:18,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-01 15:14:18,489 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-12-01 15:14:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:18,490 INFO L225 Difference]: With dead ends: 105 [2018-12-01 15:14:18,490 INFO L226 Difference]: Without dead ends: 105 [2018-12-01 15:14:18,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=778, Invalid=4052, Unknown=0, NotChecked=0, Total=4830 [2018-12-01 15:14:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-01 15:14:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2018-12-01 15:14:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-01 15:14:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-01 15:14:18,492 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 40 [2018-12-01 15:14:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:18,492 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-01 15:14:18,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-01 15:14:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-01 15:14:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-01 15:14:18,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:14:18,493 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:14:18,493 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-01 15:14:18,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:14:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1792606315, now seen corresponding path program 1 times [2018-12-01 15:14:18,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:14:18,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:14:18,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:18,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:14:18,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:14:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 15:14:18,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:14:18,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 15:14:18,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:14:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:14:18,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:14:18,702 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-01 15:14:18,704 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-01 15:14:18,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,712 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-01 15:14:18,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,717 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-01 15:14:18,732 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-01 15:14:18,733 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-01 15:14:18,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-01 15:14:18,756 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-01 15:14:18,757 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-01 15:14:18,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:14:18,764 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-01 15:14:18,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-01 15:14:21,342 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-01 15:14:21,392 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-01 15:14:21,407 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 48 treesize of output 46 [2018-12-01 15:14:21,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:21,457 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-01 15:14:21,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:21,498 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-01 15:14:21,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:21,500 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-01 15:14:21,500 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:21,545 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-01 15:14:21,545 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-01 15:14:21,600 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 40 treesize of output 30 [2018-12-01 15:14:21,600 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:21,658 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 30 treesize of output 37 [2018-12-01 15:14:21,658 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-01 15:14:21,721 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-01 15:14:21,721 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:21,722 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-01 15:14:21,723 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:14:21,779 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-01 15:14:21,779 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-01 15:14:21,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-01 15:14:21,857 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-01 15:14:21,857 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-12-01 15:14:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 15:14:21,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:14:21,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-12-01 15:14:21,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-01 15:14:21,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-01 15:14:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2018-12-01 15:14:21,967 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 33 states. [2018-12-01 15:14:24,161 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-12-01 15:14:26,284 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-01 15:14:30,470 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-12-01 15:14:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:14:31,193 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-12-01 15:14:31,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-01 15:14:31,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-12-01 15:14:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:14:31,193 INFO L225 Difference]: With dead ends: 84 [2018-12-01 15:14:31,193 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 15:14:31,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2018-12-01 15:14:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 15:14:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 15:14:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 15:14:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 15:14:31,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2018-12-01 15:14:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:14:31,194 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:14:31,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-01 15:14:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 15:14:31,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 15:14:31,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:14:31 BoogieIcfgContainer [2018-12-01 15:14:31,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 15:14:31,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:14:31,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:14:31,199 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:14:31,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:14:02" (3/4) ... [2018-12-01 15:14:31,202 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 15:14:31,207 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 15:14:31,207 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-12-01 15:14:31,207 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-01 15:14:31,207 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-01 15:14:31,207 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 15:14:31,209 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-01 15:14:31,210 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-01 15:14:31,210 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 15:14:31,236 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_228c84c3-9304-4b94-a8f5-0383dd6ec047/bin-2019/uautomizer/witness.graphml [2018-12-01 15:14:31,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:14:31,237 INFO L168 Benchmark]: Toolchain (without parser) took 28945.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.4 MB). Free memory was 949.5 MB in the beginning and 986.9 MB in the end (delta: -37.3 MB). Peak memory consumption was 381.0 MB. Max. memory is 11.5 GB. [2018-12-01 15:14:31,237 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:14:31,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-01 15:14:31,237 INFO L168 Benchmark]: Boogie Preprocessor took 35.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-01 15:14:31,237 INFO L168 Benchmark]: RCFGBuilder took 291.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-12-01 15:14:31,238 INFO L168 Benchmark]: TraceAbstraction took 28305.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 296.7 MB). Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 70.6 MB). Peak memory consumption was 367.4 MB. Max. memory is 11.5 GB. [2018-12-01 15:14:31,238 INFO L168 Benchmark]: Witness Printer took 37.55 ms. Allocated memory is still 1.4 GB. Free memory is still 986.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:14:31,239 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 291.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28305.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 296.7 MB). Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 70.6 MB). Peak memory consumption was 367.4 MB. Max. memory is 11.5 GB. * Witness Printer took 37.55 ms. Allocated memory is still 1.4 GB. Free memory is still 986.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: 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: 547]: 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: 548]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: 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, 55 locations, 15 error locations. SAFE Result, 28.2s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 18.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 1703 SDslu, 1956 SDs, 0 SdLazy, 3220 SolverSat, 341 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 136 SyntacticMatches, 6 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2702 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=14, 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, 17 MinimizatonAttempts, 177 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 535 ConstructedInterpolants, 106 QuantifiedInterpolants, 316055 SizeOfPredicates, 74 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 74/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...