./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/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 3aee1e8d9b723b18f218b6c1185554e637930c5d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:37:42,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:37:42,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:37:42,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:37:42,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:37:42,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:37:42,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:37:42,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:37:42,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:37:42,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:37:42,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:37:42,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:37:42,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:37:42,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:37:42,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:37:42,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:37:42,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:37:42,559 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:37:42,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:37:42,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:37:42,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:37:42,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:37:42,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:37:42,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:37:42,565 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:37:42,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:37:42,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:37:42,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:37:42,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:37:42,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:37:42,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:37:42,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:37:42,569 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:37:42,569 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:37:42,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:37:42,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:37:42,570 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 10:37:42,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:37:42,580 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:37:42,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:37:42,580 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:37:42,581 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:37:42,581 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:37:42,581 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:37:42,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 10:37:42,582 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 10:37:42,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:37:42,583 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:37:42,583 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:37:42,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:37:42,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:37:42,583 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:37:42,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:37:42,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:37:42,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:37:42,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:37:42,584 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:37:42,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:37:42,584 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_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2018-11-28 10:37:42,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:37:42,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:37:42,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:37:42,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:37:42,619 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:37:42,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 10:37:42,655 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/data/b97d69d68/7efc678a6ff84e3f93c68e4161298be9/FLAGf780399bd [2018-11-28 10:37:43,077 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:37:43,078 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 10:37:43,084 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/data/b97d69d68/7efc678a6ff84e3f93c68e4161298be9/FLAGf780399bd [2018-11-28 10:37:43,093 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/data/b97d69d68/7efc678a6ff84e3f93c68e4161298be9 [2018-11-28 10:37:43,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:37:43,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 10:37:43,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:37:43,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:37:43,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:37:43,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9df2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43, skipping insertion in model container [2018-11-28 10:37:43,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:37:43,130 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:37:43,308 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:37:43,316 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:37:43,390 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:37:43,416 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:37:43,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43 WrapperNode [2018-11-28 10:37:43,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:37:43,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:37:43,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:37:43,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:37:43,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... [2018-11-28 10:37:43,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:37:43,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:37:43,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:37:43,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:37:43,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:37:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:37:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:37:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:37:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 10:37:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 10:37:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 10:37:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 10:37:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 10:37:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 10:37:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 10:37:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 10:37:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 10:37:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 10:37:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 10:37:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 10:37:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 10:37:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 10:37:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 10:37:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 10:37:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 10:37:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 10:37:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 10:37:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 10:37:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 10:37:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 10:37:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 10:37:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 10:37:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 10:37:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 10:37:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 10:37:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:37:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:37:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:37:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:37:43,921 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:37:43,921 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 10:37:43,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:37:43 BoogieIcfgContainer [2018-11-28 10:37:43,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:37:43,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:37:43,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:37:43,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:37:43,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:37:43" (1/3) ... [2018-11-28 10:37:43,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e732006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:37:43, skipping insertion in model container [2018-11-28 10:37:43,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:37:43" (2/3) ... [2018-11-28 10:37:43,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e732006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:37:43, skipping insertion in model container [2018-11-28 10:37:43,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:37:43" (3/3) ... [2018-11-28 10:37:43,928 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 10:37:43,934 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:37:43,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-11-28 10:37:43,950 INFO L257 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2018-11-28 10:37:43,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:37:43,965 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:37:43,966 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 10:37:43,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:37:43,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:37:43,966 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:37:43,966 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:37:43,966 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:37:43,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:37:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states. [2018-11-28 10:37:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 10:37:43,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:43,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:43,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:43,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1280679066, now seen corresponding path program 1 times [2018-11-28 10:37:43,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:43,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:44,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:44,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:44,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:44,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:37:44,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:37:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:37:44,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:37:44,104 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 3 states. [2018-11-28 10:37:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:44,231 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-28 10:37:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:37:44,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 10:37:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:44,239 INFO L225 Difference]: With dead ends: 113 [2018-11-28 10:37:44,239 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 10:37:44,241 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-11-28 10:37:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 10:37:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-28 10:37:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 10:37:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-11-28 10:37:44,268 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 7 [2018-11-28 10:37:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:44,268 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-11-28 10:37:44,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:37:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-11-28 10:37:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 10:37:44,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:44,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:44,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:44,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:44,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1280679065, now seen corresponding path program 1 times [2018-11-28 10:37:44,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:44,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:44,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:44,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:44,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-11-28 10:37:44,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:44,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:37:44,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:37:44,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:37:44,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:37:44,315 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-11-28 10:37:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:44,427 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-28 10:37:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:37:44,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 10:37:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:44,428 INFO L225 Difference]: With dead ends: 119 [2018-11-28 10:37:44,428 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 10:37:44,429 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-11-28 10:37:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 10:37:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-11-28 10:37:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 10:37:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-11-28 10:37:44,434 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 7 [2018-11-28 10:37:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:44,434 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-11-28 10:37:44,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:37:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-28 10:37:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 10:37:44,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:44,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:44,435 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:44,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1559376120, now seen corresponding path program 1 times [2018-11-28 10:37:44,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:44,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:44,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:37:44,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:37:44,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:37:44,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:37:44,507 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 4 states. [2018-11-28 10:37:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:44,652 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-28 10:37:44,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:37:44,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 10:37:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:44,653 INFO L225 Difference]: With dead ends: 117 [2018-11-28 10:37:44,653 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 10:37:44,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:37:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 10:37:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-11-28 10:37:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 10:37:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-28 10:37:44,660 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 12 [2018-11-28 10:37:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:44,660 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-28 10:37:44,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:37:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-28 10:37:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 10:37:44,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:44,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:44,661 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:44,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1559376119, now seen corresponding path program 1 times [2018-11-28 10:37:44,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:44,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:44,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:44,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:44,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:44,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:37:44,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:37:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:37:44,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:37:44,715 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 4 states. [2018-11-28 10:37:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:44,828 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-11-28 10:37:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:37:44,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 10:37:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:44,830 INFO L225 Difference]: With dead ends: 134 [2018-11-28 10:37:44,830 INFO L226 Difference]: Without dead ends: 134 [2018-11-28 10:37:44,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:37:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-28 10:37:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2018-11-28 10:37:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 10:37:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-11-28 10:37:44,836 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 12 [2018-11-28 10:37:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:44,836 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-11-28 10:37:44,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:37:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-11-28 10:37:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 10:37:44,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:44,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:44,839 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:44,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1007724238, now seen corresponding path program 1 times [2018-11-28 10:37:44,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:44,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:44,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:37:44,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:37:44,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:37:44,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:37:44,890 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 6 states. [2018-11-28 10:37:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:45,070 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2018-11-28 10:37:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:37:45,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 10:37:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:45,071 INFO L225 Difference]: With dead ends: 181 [2018-11-28 10:37:45,071 INFO L226 Difference]: Without dead ends: 181 [2018-11-28 10:37:45,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:37:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-28 10:37:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 110. [2018-11-28 10:37:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 10:37:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-11-28 10:37:45,078 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 15 [2018-11-28 10:37:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:45,078 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-11-28 10:37:45,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:37:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-11-28 10:37:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 10:37:45,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:45,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:45,082 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:45,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1007724237, now seen corresponding path program 1 times [2018-11-28 10:37:45,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:45,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:45,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:45,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:37:45,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:37:45,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:37:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:37:45,149 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 6 states. [2018-11-28 10:37:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:45,357 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-11-28 10:37:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:37:45,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 10:37:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:45,358 INFO L225 Difference]: With dead ends: 182 [2018-11-28 10:37:45,358 INFO L226 Difference]: Without dead ends: 182 [2018-11-28 10:37:45,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 10:37:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-28 10:37:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 105. [2018-11-28 10:37:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 10:37:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-11-28 10:37:45,363 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 15 [2018-11-28 10:37:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:45,363 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-11-28 10:37:45,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:37:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-11-28 10:37:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 10:37:45,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:45,363 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] [2018-11-28 10:37:45,364 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:45,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash 305175762, now seen corresponding path program 1 times [2018-11-28 10:37:45,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:45,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:45,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:45,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:37:45,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:37:45,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:37:45,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:37:45,407 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 4 states. [2018-11-28 10:37:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:45,477 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-11-28 10:37:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:37:45,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-28 10:37:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:45,478 INFO L225 Difference]: With dead ends: 119 [2018-11-28 10:37:45,478 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 10:37:45,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:37:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 10:37:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-11-28 10:37:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 10:37:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-28 10:37:45,482 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 21 [2018-11-28 10:37:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:45,483 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-28 10:37:45,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:37:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-28 10:37:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 10:37:45,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:45,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:45,484 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:45,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:45,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1227495682, now seen corresponding path program 1 times [2018-11-28 10:37:45,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:45,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:45,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:37:45,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:37:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:37:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:37:45,582 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 5 states. [2018-11-28 10:37:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:45,659 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-11-28 10:37:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:37:45,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 10:37:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:45,660 INFO L225 Difference]: With dead ends: 111 [2018-11-28 10:37:45,660 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 10:37:45,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:37:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 10:37:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-11-28 10:37:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 10:37:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-11-28 10:37:45,664 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-11-28 10:37:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:45,664 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-28 10:37:45,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:37:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-28 10:37:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 10:37:45,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:45,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:45,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:45,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash -601833439, now seen corresponding path program 1 times [2018-11-28 10:37:45,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:45,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:45,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:45,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:45,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:45,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:37:45,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:37:45,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:37:45,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:37:45,714 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 6 states. [2018-11-28 10:37:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:45,903 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2018-11-28 10:37:45,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:37:45,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 10:37:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:45,904 INFO L225 Difference]: With dead ends: 165 [2018-11-28 10:37:45,904 INFO L226 Difference]: Without dead ends: 165 [2018-11-28 10:37:45,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:37:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-28 10:37:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 103. [2018-11-28 10:37:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 10:37:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-11-28 10:37:45,908 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 23 [2018-11-28 10:37:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:45,908 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-11-28 10:37:45,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:37:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-11-28 10:37:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 10:37:45,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:45,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:45,912 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:45,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash -601833438, now seen corresponding path program 1 times [2018-11-28 10:37:45,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:45,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:45,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:45,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:45,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:37:45,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:37:45,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:37:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:37:45,972 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 6 states. [2018-11-28 10:37:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:46,136 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2018-11-28 10:37:46,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:37:46,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 10:37:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:46,137 INFO L225 Difference]: With dead ends: 182 [2018-11-28 10:37:46,137 INFO L226 Difference]: Without dead ends: 182 [2018-11-28 10:37:46,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:37:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-28 10:37:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 95. [2018-11-28 10:37:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 10:37:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-11-28 10:37:46,140 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 23 [2018-11-28 10:37:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:46,140 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-11-28 10:37:46,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:37:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-11-28 10:37:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:37:46,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:46,141 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:46,141 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:46,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash -513964692, now seen corresponding path program 1 times [2018-11-28 10:37:46,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:46,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:46,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:46,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:37:46,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:37:46,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:37:46,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:37:46,208 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 5 states. [2018-11-28 10:37:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:46,290 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-11-28 10:37:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:37:46,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 10:37:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:46,291 INFO L225 Difference]: With dead ends: 109 [2018-11-28 10:37:46,291 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 10:37:46,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:37:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 10:37:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-11-28 10:37:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 10:37:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-11-28 10:37:46,294 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2018-11-28 10:37:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:46,294 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-11-28 10:37:46,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:37:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-11-28 10:37:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 10:37:46,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:46,295 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:46,295 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:46,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash 435598066, now seen corresponding path program 1 times [2018-11-28 10:37:46,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:46,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:46,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:46,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:46,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:46,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:46,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:46,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:46,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 10:37:46,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-28 10:37:46,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:46,567 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:46,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-28 10:37:46,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:46,638 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 36 treesize of output 37 [2018-11-28 10:37:46,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:46,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-28 10:37:46,678 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-28 10:37:46,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:46,682 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 30 treesize of output 18 [2018-11-28 10:37:46,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,696 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-11-28 10:37:46,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-11-28 10:37:46,757 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 36 treesize of output 24 [2018-11-28 10:37:46,759 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 19 treesize of output 10 [2018-11-28 10:37:46,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,767 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 5 treesize of output 1 [2018-11-28 10:37:46,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:46,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:46,773 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-11-28 10:37:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:46,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:37:46,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 10:37:46,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 10:37:46,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 10:37:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-11-28 10:37:46,842 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 22 states. [2018-11-28 10:37:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:47,472 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2018-11-28 10:37:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 10:37:47,472 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-28 10:37:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:47,473 INFO L225 Difference]: With dead ends: 179 [2018-11-28 10:37:47,473 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 10:37:47,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-11-28 10:37:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 10:37:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-11-28 10:37:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 10:37:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-11-28 10:37:47,477 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 36 [2018-11-28 10:37:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:47,478 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-11-28 10:37:47,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 10:37:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-11-28 10:37:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 10:37:47,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:47,479 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:47,479 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:47,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash 435598067, now seen corresponding path program 1 times [2018-11-28 10:37:47,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:47,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:47,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:47,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:47,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:47,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:47,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:47,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:47,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:47,679 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 6 treesize of output 5 [2018-11-28 10:37:47,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:47,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:47,689 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 11 treesize of output 4 [2018-11-28 10:37:47,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 10:37:47,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:47,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:47,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:47,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-28 10:37:47,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:47,773 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 36 treesize of output 37 [2018-11-28 10:37:47,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:47,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:47,811 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 19 treesize of output 24 [2018-11-28 10:37:47,814 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-11-28 10:37:47,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-11-28 10:37:47,871 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-28 10:37:47,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:47,875 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 30 treesize of output 18 [2018-11-28 10:37:47,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,899 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 50 treesize of output 45 [2018-11-28 10:37:47,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:47,904 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 30 treesize of output 18 [2018-11-28 10:37:47,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:47,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-11-28 10:37:47,985 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 47 treesize of output 33 [2018-11-28 10:37:47,988 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 28 treesize of output 17 [2018-11-28 10:37:47,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,995 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 5 treesize of output 1 [2018-11-28 10:37:47,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:47,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:48,007 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 22 treesize of output 20 [2018-11-28 10:37:48,008 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 5 treesize of output 1 [2018-11-28 10:37:48,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:48,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:37:48,013 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:48,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:48,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:48,018 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-11-28 10:37:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:48,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:37:48,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2018-11-28 10:37:48,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:37:48,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:37:48,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:37:48,045 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 17 states. [2018-11-28 10:37:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:48,647 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2018-11-28 10:37:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 10:37:48,647 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-28 10:37:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:48,647 INFO L225 Difference]: With dead ends: 184 [2018-11-28 10:37:48,647 INFO L226 Difference]: Without dead ends: 184 [2018-11-28 10:37:48,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-11-28 10:37:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-28 10:37:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2018-11-28 10:37:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 10:37:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-11-28 10:37:48,651 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 36 [2018-11-28 10:37:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:48,651 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-11-28 10:37:48,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:37:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-11-28 10:37:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 10:37:48,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:48,653 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:48,653 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:48,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 147100084, now seen corresponding path program 1 times [2018-11-28 10:37:48,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:48,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:49,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:49,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:49,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:49,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:49,064 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 6 treesize of output 5 [2018-11-28 10:37:49,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:49,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:49,076 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 11 treesize of output 4 [2018-11-28 10:37:49,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 10:37:49,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:49,110 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:49,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:49,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:49,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-28 10:37:49,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:49,204 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 36 treesize of output 37 [2018-11-28 10:37:49,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:49,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:49,231 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 19 treesize of output 24 [2018-11-28 10:37:49,234 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-11-28 10:37:49,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-11-28 10:37:49,273 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 21 treesize of output 3 [2018-11-28 10:37:49,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,302 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 104 [2018-11-28 10:37:49,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:49,306 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 30 treesize of output 18 [2018-11-28 10:37:49,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,330 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 21 treesize of output 14 [2018-11-28 10:37:49,332 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 14 treesize of output 13 [2018-11-28 10:37:49,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,343 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,357 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 50 treesize of output 45 [2018-11-28 10:37:49,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:49,360 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 30 treesize of output 18 [2018-11-28 10:37:49,361 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,365 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:49,372 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-11-28 10:37:49,439 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 51 treesize of output 37 [2018-11-28 10:37:49,441 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 32 treesize of output 21 [2018-11-28 10:37:49,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,450 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 5 treesize of output 1 [2018-11-28 10:37:49,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,461 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 22 treesize of output 20 [2018-11-28 10:37:49,463 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 5 treesize of output 1 [2018-11-28 10:37:49,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:37:49,468 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:49,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:49,474 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-11-28 10:37:49,515 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 19 treesize of output 15 [2018-11-28 10:37:49,520 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 15 treesize of output 12 [2018-11-28 10:37:49,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 10:37:49,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:37:49,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:37:49,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-11-28 10:37:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:49,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:37:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-11-28 10:37:49,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 10:37:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 10:37:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-11-28 10:37:49,594 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 32 states. [2018-11-28 10:37:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:51,253 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2018-11-28 10:37:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 10:37:51,253 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-11-28 10:37:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:51,254 INFO L225 Difference]: With dead ends: 182 [2018-11-28 10:37:51,254 INFO L226 Difference]: Without dead ends: 182 [2018-11-28 10:37:51,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=408, Invalid=2347, Unknown=1, NotChecked=0, Total=2756 [2018-11-28 10:37:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-28 10:37:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 121. [2018-11-28 10:37:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 10:37:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-11-28 10:37:51,266 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 40 [2018-11-28 10:37:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:51,266 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-11-28 10:37:51,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 10:37:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-11-28 10:37:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 10:37:51,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:51,267 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:51,267 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:51,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 935958873, now seen corresponding path program 1 times [2018-11-28 10:37:51,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:51,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:51,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:51,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:51,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:51,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:51,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,479 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 11 treesize of output 4 [2018-11-28 10:37:51,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 10:37:51,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:51,489 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:51,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-28 10:37:51,549 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 19 treesize of output 20 [2018-11-28 10:37:51,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:51,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:24 [2018-11-28 10:37:51,579 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 34 treesize of output 33 [2018-11-28 10:37:51,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,587 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 22 treesize of output 14 [2018-11-28 10:37:51,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2018-11-28 10:37:51,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 10:37:51,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-11-28 10:37:51,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 10:37:51,636 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 14 treesize of output 7 [2018-11-28 10:37:51,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-11-28 10:37:51,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-11-28 10:37:51,733 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 2 case distinctions, treesize of input 48 treesize of output 47 [2018-11-28 10:37:51,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 10:37:51,765 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 49 treesize of output 48 [2018-11-28 10:37:51,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:37:51,791 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 2 xjuncts. [2018-11-28 10:37:51,791 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:81 [2018-11-28 10:37:51,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 76 [2018-11-28 10:37:51,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,848 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 83 treesize of output 67 [2018-11-28 10:37:51,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 70 [2018-11-28 10:37:51,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 10:37:51,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:37:51,911 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-28 10:37:51,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:51,914 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 30 treesize of output 18 [2018-11-28 10:37:51,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:51,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 10:37:51,931 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:149, output treesize:106 [2018-11-28 10:37:52,018 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 36 treesize of output 24 [2018-11-28 10:37:52,020 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 19 treesize of output 10 [2018-11-28 10:37:52,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,024 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 5 treesize of output 1 [2018-11-28 10:37:52,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-11-28 10:37:52,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-28 10:37:52,047 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,057 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 30 treesize of output 21 [2018-11-28 10:37:52,058 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,067 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 24 treesize of output 19 [2018-11-28 10:37:52,067 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 10:37:52,078 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 10:37:52,089 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 19 treesize of output 10 [2018-11-28 10:37:52,089 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:52,099 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-11-28 10:37:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:52,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:37:52,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 23 [2018-11-28 10:37:52,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 10:37:52,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 10:37:52,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2018-11-28 10:37:52,127 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 24 states. [2018-11-28 10:37:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:52,973 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2018-11-28 10:37:52,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 10:37:52,973 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-11-28 10:37:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:52,974 INFO L225 Difference]: With dead ends: 206 [2018-11-28 10:37:52,974 INFO L226 Difference]: Without dead ends: 206 [2018-11-28 10:37:52,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1521, Unknown=3, NotChecked=0, Total=1806 [2018-11-28 10:37:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-28 10:37:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 146. [2018-11-28 10:37:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 10:37:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-28 10:37:52,978 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 42 [2018-11-28 10:37:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:52,979 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-28 10:37:52,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 10:37:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-28 10:37:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 10:37:52,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:52,982 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:52,982 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:52,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 935958874, now seen corresponding path program 1 times [2018-11-28 10:37:52,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:52,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:52,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:53,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:53,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:53,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:53,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:53,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 10:37:53,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-28 10:37:53,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:53,323 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:53,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:53,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:53,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-28 10:37:53,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,427 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 36 treesize of output 37 [2018-11-28 10:37:53,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:53,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,445 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 19 treesize of output 24 [2018-11-28 10:37:53,447 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-11-28 10:37:53,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-11-28 10:37:53,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,489 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 62 treesize of output 61 [2018-11-28 10:37:53,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,492 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 22 treesize of output 14 [2018-11-28 10:37:53,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-11-28 10:37:53,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,520 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 26 treesize of output 37 [2018-11-28 10:37:53,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2018-11-28 10:37:53,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,570 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 14 treesize of output 21 [2018-11-28 10:37:53,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 10:37:53,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-11-28 10:37:53,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-28 10:37:53,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-28 10:37:53,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-28 10:37:53,681 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 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-28 10:37:53,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:66 [2018-11-28 10:37:53,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2018-11-28 10:37:53,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:53,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-28 10:37:53,804 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 16 treesize of output 15 [2018-11-28 10:37:53,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:53,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-11-28 10:37:53,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 130 [2018-11-28 10:37:53,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,864 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 38 treesize of output 22 [2018-11-28 10:37:53,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-28 10:37:53,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:53,896 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 38 treesize of output 22 [2018-11-28 10:37:53,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:53,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:53,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101 [2018-11-28 10:37:53,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-11-28 10:37:53,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-28 10:37:53,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:54,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-28 10:37:54,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:54,012 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 5 treesize of output 1 [2018-11-28 10:37:54,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:54,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:54,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 10:37:54,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:37:54,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:54,036 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 5 treesize of output 1 [2018-11-28 10:37:54,036 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:54,038 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:54,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:54,046 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-11-28 10:37:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:54,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:37:54,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-11-28 10:37:54,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 10:37:54,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 10:37:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-11-28 10:37:54,122 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 32 states. [2018-11-28 10:37:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:55,644 INFO L93 Difference]: Finished difference Result 255 states and 278 transitions. [2018-11-28 10:37:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 10:37:55,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-11-28 10:37:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:55,646 INFO L225 Difference]: With dead ends: 255 [2018-11-28 10:37:55,646 INFO L226 Difference]: Without dead ends: 255 [2018-11-28 10:37:55,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-11-28 10:37:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-28 10:37:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 148. [2018-11-28 10:37:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-28 10:37:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-11-28 10:37:55,651 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 42 [2018-11-28 10:37:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:55,652 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-11-28 10:37:55,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 10:37:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-11-28 10:37:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 10:37:55,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:55,653 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:55,653 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:55,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:55,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1353917894, now seen corresponding path program 1 times [2018-11-28 10:37:55,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:55,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:55,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 10:37:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:37:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:37:55,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:37:55,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:37:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:37:55,703 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 6 states. [2018-11-28 10:37:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:55,791 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-11-28 10:37:55,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 10:37:55,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-28 10:37:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:55,792 INFO L225 Difference]: With dead ends: 118 [2018-11-28 10:37:55,792 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 10:37:55,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:37:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 10:37:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2018-11-28 10:37:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 10:37:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-11-28 10:37:55,795 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 43 [2018-11-28 10:37:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:55,795 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-28 10:37:55,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:37:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-11-28 10:37:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 10:37:55,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:55,796 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:55,796 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:55,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash -389524194, now seen corresponding path program 2 times [2018-11-28 10:37:55,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:55,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:55,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:37:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:55,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:55,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:55,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:37:55,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:37:55,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:37:55,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:56,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:56,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:56,020 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 11 treesize of output 4 [2018-11-28 10:37:56,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-28 10:37:56,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:56,042 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:56,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:56,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:56,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-11-28 10:37:56,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:56,109 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 26 treesize of output 31 [2018-11-28 10:37:56,111 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 15 [2018-11-28 10:37:56,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:56,127 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 42 treesize of output 43 [2018-11-28 10:37:56,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 10:37:56,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:59 [2018-11-28 10:37:56,163 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 116 treesize of output 111 [2018-11-28 10:37:56,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:56,166 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 42 treesize of output 30 [2018-11-28 10:37:56,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,183 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-11-28 10:37:56,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:56,186 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 42 treesize of output 30 [2018-11-28 10:37:56,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2018-11-28 10:37:56,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:56,323 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:37:56,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-11-28 10:37:56,329 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:37:56,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 46 treesize of output 30 [2018-11-28 10:37:56,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:56,343 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:37:56,344 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 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 10:37:56,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:37:56,365 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 37 treesize of output 29 [2018-11-28 10:37:56,368 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:37:56,369 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 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 10:37:56,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,378 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 16 treesize of output 7 [2018-11-28 10:37:56,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:56,393 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2018-11-28 10:37:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:56,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:37:56,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-11-28 10:37:56,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 10:37:56,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 10:37:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=722, Unknown=3, NotChecked=0, Total=812 [2018-11-28 10:37:56,461 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 29 states. [2018-11-28 10:37:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:57,209 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-11-28 10:37:57,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 10:37:57,209 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-11-28 10:37:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:57,209 INFO L225 Difference]: With dead ends: 124 [2018-11-28 10:37:57,209 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 10:37:57,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1273, Unknown=4, NotChecked=0, Total=1482 [2018-11-28 10:37:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 10:37:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2018-11-28 10:37:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 10:37:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-11-28 10:37:57,212 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 44 [2018-11-28 10:37:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:57,212 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-11-28 10:37:57,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 10:37:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-11-28 10:37:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 10:37:57,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:57,213 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:57,214 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:57,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571308, now seen corresponding path program 3 times [2018-11-28 10:37:57,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:57,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:57,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:37:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:57,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:57,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 10:37:57,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 10:37:57,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:37:57,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:57,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,428 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 11 treesize of output 4 [2018-11-28 10:37:57,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 10:37:57,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:57,447 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:57,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-11-28 10:37:57,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,505 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 27 treesize of output 28 [2018-11-28 10:37:57,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:57,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-28 10:37:57,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,539 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 42 treesize of output 41 [2018-11-28 10:37:57,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,542 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 22 treesize of output 14 [2018-11-28 10:37:57,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2018-11-28 10:37:57,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,555 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 11 treesize of output 4 [2018-11-28 10:37:57,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-11-28 10:37:57,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 10:37:57,586 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 14 treesize of output 7 [2018-11-28 10:37:57,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-11-28 10:37:57,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-11-28 10:37:57,689 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 2 case distinctions, treesize of input 48 treesize of output 47 [2018-11-28 10:37:57,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 10:37:57,717 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 49 treesize of output 48 [2018-11-28 10:37:57,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:37:57,749 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 2 xjuncts. [2018-11-28 10:37:57,749 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:87 [2018-11-28 10:37:57,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2018-11-28 10:37:57,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,812 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 86 treesize of output 70 [2018-11-28 10:37:57,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 59 [2018-11-28 10:37:57,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 10:37:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:37:57,905 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-11-28 10:37:57,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:57,908 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 30 treesize of output 18 [2018-11-28 10:37:57,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:57,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 10:37:57,948 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:113 [2018-11-28 10:37:58,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-11-28 10:37:58,126 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:37:58,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-28 10:37:58,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 10:37:58,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 10:37:58,167 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 44 treesize of output 39 [2018-11-28 10:37:58,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,186 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:37:58,187 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 39 treesize of output 31 [2018-11-28 10:37:58,187 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 10:37:58,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,225 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-28 10:37:58,226 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:37:58,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 10:37:58,227 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,232 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 5 treesize of output 1 [2018-11-28 10:37:58,232 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:58,242 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-11-28 10:37:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:58,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:37:58,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2018-11-28 10:37:58,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 10:37:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 10:37:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2018-11-28 10:37:58,276 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2018-11-28 10:37:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:37:59,543 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-11-28 10:37:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 10:37:59,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-11-28 10:37:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:37:59,544 INFO L225 Difference]: With dead ends: 161 [2018-11-28 10:37:59,544 INFO L226 Difference]: Without dead ends: 161 [2018-11-28 10:37:59,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=2077, Unknown=5, NotChecked=0, Total=2450 [2018-11-28 10:37:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-28 10:37:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2018-11-28 10:37:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 10:37:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-11-28 10:37:59,548 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 45 [2018-11-28 10:37:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:37:59,548 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-11-28 10:37:59,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 10:37:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-11-28 10:37:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 10:37:59,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:37:59,549 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:37:59,549 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:37:59,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:37:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571309, now seen corresponding path program 2 times [2018-11-28 10:37:59,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:37:59,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:37:59,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:59,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:37:59,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:37:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:37:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:37:59,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:37:59,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:37:59,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:37:59,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:37:59,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:37:59,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:37:59,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:59,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:37:59,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 10:37:59,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:59,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:59,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-28 10:37:59,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:59,946 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:59,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:59,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:59,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:37:59,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:37:59,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:37:59,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:59,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:37:59,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-28 10:38:00,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,044 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 19 treesize of output 24 [2018-11-28 10:38:00,045 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-11-28 10:38:00,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,063 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 47 treesize of output 48 [2018-11-28 10:38:00,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:00,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-11-28 10:38:00,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-11-28 10:38:00,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,116 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 26 treesize of output 37 [2018-11-28 10:38:00,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,140 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 62 treesize of output 61 [2018-11-28 10:38:00,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,143 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 22 treesize of output 14 [2018-11-28 10:38:00,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:68 [2018-11-28 10:38:00,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,192 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 14 treesize of output 21 [2018-11-28 10:38:00,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 10:38:00,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:75 [2018-11-28 10:38:00,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 10:38:00,261 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 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-28 10:38:00,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-28 10:38:00,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-28 10:38:00,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2018-11-28 10:38:00,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,417 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 19 treesize of output 28 [2018-11-28 10:38:00,419 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 16 treesize of output 15 [2018-11-28 10:38:00,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2018-11-28 10:38:00,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:00,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:00,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:99 [2018-11-28 10:38:00,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-28 10:38:00,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,512 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 38 treesize of output 22 [2018-11-28 10:38:00,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 99 [2018-11-28 10:38:00,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:00,543 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 38 treesize of output 22 [2018-11-28 10:38:00,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:00,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104 [2018-11-28 10:38:00,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66 [2018-11-28 10:38:00,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-28 10:38:00,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:00,700 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:38:00,701 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 27 treesize of output 19 [2018-11-28 10:38:00,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,710 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 5 treesize of output 1 [2018-11-28 10:38:00,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:00,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 10:38:00,732 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:38:00,732 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 10:38:00,732 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,737 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 5 treesize of output 1 [2018-11-28 10:38:00,737 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,739 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:00,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:00,747 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:121, output treesize:18 [2018-11-28 10:38:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:38:00,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:38:00,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-11-28 10:38:00,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 10:38:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 10:38:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 10:38:00,820 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 35 states. [2018-11-28 10:38:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:38:02,266 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2018-11-28 10:38:02,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 10:38:02,266 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2018-11-28 10:38:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:38:02,267 INFO L225 Difference]: With dead ends: 166 [2018-11-28 10:38:02,267 INFO L226 Difference]: Without dead ends: 166 [2018-11-28 10:38:02,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=454, Invalid=2738, Unknown=0, NotChecked=0, Total=3192 [2018-11-28 10:38:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-28 10:38:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2018-11-28 10:38:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 10:38:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-11-28 10:38:02,269 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2018-11-28 10:38:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:38:02,269 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-28 10:38:02,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 10:38:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-28 10:38:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 10:38:02,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:38:02,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:38:02,270 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:38:02,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:38:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1671435109, now seen corresponding path program 1 times [2018-11-28 10:38:02,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:38:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:38:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:38:02,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:38:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:38:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:38:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:38:02,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:38:02,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:38:02,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:38:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:38:02,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:38:02,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 10:38:02,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-28 10:38:02,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:38:02,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:02,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:38:02,566 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:02,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-28 10:38:02,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,647 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 36 treesize of output 37 [2018-11-28 10:38:02,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 10:38:02,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,667 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 37 treesize of output 42 [2018-11-28 10:38:02,669 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 15 [2018-11-28 10:38:02,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-11-28 10:38:02,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,727 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 70 treesize of output 69 [2018-11-28 10:38:02,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,730 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 26 treesize of output 22 [2018-11-28 10:38:02,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2018-11-28 10:38:02,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,755 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 30 treesize of output 45 [2018-11-28 10:38:02,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,775 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-11-28 10:38:02,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 10:38:02,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-11-28 10:38:02,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-28 10:38:02,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-11-28 10:38:02,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-28 10:38:02,865 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 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-28 10:38:02,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-11-28 10:38:02,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,969 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 87 treesize of output 88 [2018-11-28 10:38:02,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:02,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:02,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:02,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:03,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2018-11-28 10:38:03,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:03,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:100 [2018-11-28 10:38:03,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 164 [2018-11-28 10:38:03,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:03,067 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 46 treesize of output 26 [2018-11-28 10:38:03,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 128 [2018-11-28 10:38:03,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:03,110 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 46 treesize of output 26 [2018-11-28 10:38:03,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:03,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2018-11-28 10:38:03,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-11-28 10:38:03,217 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 75 treesize of output 60 [2018-11-28 10:38:03,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,228 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 5 treesize of output 1 [2018-11-28 10:38:03,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:03,242 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-11-28 10:38:03,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-11-28 10:38:03,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-28 10:38:03,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,320 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 5 treesize of output 1 [2018-11-28 10:38:03,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:03,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-28 10:38:03,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:03,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:03,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:03,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-11-28 10:38:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:38:03,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:38:03,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-11-28 10:38:03,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 10:38:03,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 10:38:03,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 10:38:03,417 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 36 states. [2018-11-28 10:38:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:38:04,392 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-11-28 10:38:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 10:38:04,392 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-11-28 10:38:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:38:04,392 INFO L225 Difference]: With dead ends: 164 [2018-11-28 10:38:04,393 INFO L226 Difference]: Without dead ends: 164 [2018-11-28 10:38:04,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2018-11-28 10:38:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-28 10:38:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2018-11-28 10:38:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 10:38:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-11-28 10:38:04,395 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 46 [2018-11-28 10:38:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:38:04,395 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-11-28 10:38:04,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 10:38:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-11-28 10:38:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 10:38:04,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:38:04,396 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:38:04,396 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:38:04,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:38:04,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1671435108, now seen corresponding path program 1 times [2018-11-28 10:38:04,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:38:04,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:38:04,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:38:04,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:38:04,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:38:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:38:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:38:04,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:38:04,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:38:04,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:38:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:38:04,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:38:04,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:04,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:04,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 10:38:04,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-28 10:38:04,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:38:04,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:04,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:38:04,795 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:04,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-28 10:38:04,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:04,883 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 26 treesize of output 31 [2018-11-28 10:38:04,885 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 15 [2018-11-28 10:38:04,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:04,927 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 51 treesize of output 52 [2018-11-28 10:38:04,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 10:38:04,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:04,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-11-28 10:38:04,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-11-28 10:38:04,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:04,992 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 30 treesize of output 45 [2018-11-28 10:38:04,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,018 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 70 treesize of output 69 [2018-11-28 10:38:05,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,021 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 26 treesize of output 22 [2018-11-28 10:38:05,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-11-28 10:38:05,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 10:38:05,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:38:05,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2018-11-28 10:38:05,103 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:38:05,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 67 [2018-11-28 10:38:05,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-28 10:38:05,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-28 10:38:05,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-11-28 10:38:05,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:86 [2018-11-28 10:38:05,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 119 [2018-11-28 10:38:05,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:05,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 103 [2018-11-28 10:38:05,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:38:05,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:101 [2018-11-28 10:38:05,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 206 [2018-11-28 10:38:05,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,354 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 46 treesize of output 26 [2018-11-28 10:38:05,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 127 [2018-11-28 10:38:05,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:38:05,389 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 46 treesize of output 26 [2018-11-28 10:38:05,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:05,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:232, output treesize:122 [2018-11-28 10:38:05,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-11-28 10:38:05,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-11-28 10:38:05,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,594 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 5 treesize of output 1 [2018-11-28 10:38:05,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-28 10:38:05,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:05,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:38:05,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-28 10:38:05,622 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 5 treesize of output 1 [2018-11-28 10:38:05,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,628 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 20 treesize of output 11 [2018-11-28 10:38:05,628 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:38:05,631 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,632 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:38:05,636 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:152, output treesize:9 [2018-11-28 10:38:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:38:05,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:38:05,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-11-28 10:38:05,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 10:38:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 10:38:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 10:38:05,662 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 33 states. [2018-11-28 10:38:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:38:06,788 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-11-28 10:38:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 10:38:06,791 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2018-11-28 10:38:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:38:06,792 INFO L225 Difference]: With dead ends: 162 [2018-11-28 10:38:06,792 INFO L226 Difference]: Without dead ends: 162 [2018-11-28 10:38:06,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1921, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 10:38:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-28 10:38:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2018-11-28 10:38:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 10:38:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-28 10:38:06,795 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 46 [2018-11-28 10:38:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:38:06,795 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-28 10:38:06,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 10:38:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-28 10:38:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 10:38:06,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:38:06,796 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:38:06,796 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-11-28 10:38:06,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:38:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash 68631713, now seen corresponding path program 1 times [2018-11-28 10:38:06,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:38:06,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:38:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:38:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:38:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:38:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:38:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:38:06,846 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 10:38:06,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:38:06 BoogieIcfgContainer [2018-11-28 10:38:06,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:38:06,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:38:06,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:38:06,875 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:38:06,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:37:43" (3/4) ... [2018-11-28 10:38:06,877 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 10:38:06,920 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_770f39a4-7b96-44f3-89c2-5a1a1c9e3be6/bin-2019/uautomizer/witness.graphml [2018-11-28 10:38:06,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:38:06,921 INFO L168 Benchmark]: Toolchain (without parser) took 23826.16 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 354.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:38:06,922 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:38:06,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:38:06,922 INFO L168 Benchmark]: Boogie Preprocessor took 34.85 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-11-28 10:38:06,923 INFO L168 Benchmark]: RCFGBuilder took 469.98 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: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:38:06,923 INFO L168 Benchmark]: TraceAbstraction took 22951.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 399.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.3 MB). Peak memory consumption was 319.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:38:06,923 INFO L168 Benchmark]: Witness Printer took 46.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:38:06,924 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.85 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 469.98 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: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22951.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 399.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.3 MB). Peak memory consumption was 319.7 MB. Max. memory is 11.5 GB. * Witness Printer took 46.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L996] list->next = ((void*)0) VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L997] list->colour = BLACK VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L999] SLL* end = list; VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1017] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1019] end->colour = BLACK VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1028] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1032] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1032] EXPR end->colour VAL [end={12:0}, end->colour=0, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={22:0}, end->next={0:0}, list={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1035] end = end->next [L1038] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 112 locations, 49 error locations. UNSAFE Result, 22.9s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1278 SDtfs, 4448 SDslu, 6096 SDs, 0 SdLazy, 13286 SolverSat, 901 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 828 GetRequests, 297 SyntacticMatches, 42 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=16, 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, 22 MinimizatonAttempts, 905 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 183 QuantifiedInterpolants, 1191401 SizeOfPredicates, 168 NumberOfNonLiveVariables, 1916 ConjunctsInSsa, 486 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 14/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...