./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-1dbac8b [2018-10-27 04:45:27,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:45:27,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:45:27,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:45:27,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:45:27,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:45:27,938 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:45:27,940 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:45:27,942 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:45:27,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:45:27,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:45:27,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:45:27,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:45:27,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:45:27,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:45:27,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:45:27,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:45:27,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:45:27,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:45:27,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:45:27,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:45:27,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:45:27,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:45:27,973 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:45:27,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:45:27,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:45:27,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:45:27,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:45:27,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:45:27,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:45:27,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:45:27,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:45:27,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:45:27,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:45:27,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:45:27,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:45:27,981 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-27 04:45:27,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:45:27,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:45:27,996 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:45:27,997 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:45:27,998 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:45:27,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:45:27,998 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:45:27,999 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:45:27,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:45:27,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:45:27,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:45:27,999 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:45:27,999 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:45:28,000 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:45:28,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:45:28,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:45:28,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:45:28,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:45:28,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:45:28,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:45:28,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:45:28,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:45:28,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:45:28,001 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 04:45:28,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:45:28,002 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_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:28,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:45:28,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:45:28,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:45:28,065 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:45:28,068 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:45:28,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-10-27 04:45:28,127 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/data/734bed00c/bd6a137946c342a983f3c782b847d4bd/FLAG38cdf515a [2018-10-27 04:45:28,538 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:45:28,540 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-10-27 04:45:28,553 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/data/734bed00c/bd6a137946c342a983f3c782b847d4bd/FLAG38cdf515a [2018-10-27 04:45:28,564 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/data/734bed00c/bd6a137946c342a983f3c782b847d4bd [2018-10-27 04:45:28,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:45:28,567 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:45:28,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:28,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:45:28,571 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:45:28,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:28,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b298a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28, skipping insertion in model container [2018-10-27 04:45:28,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:28,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:45:28,616 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:45:28,846 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:28,853 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:45:28,888 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:28,922 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:45:28,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28 WrapperNode [2018-10-27 04:45:28,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:28,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:45:28,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:45:28,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:45:28,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:28,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:29,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:29,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:29,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:29,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:29,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... [2018-10-27 04:45:29,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:45:29,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:45:29,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:45:29,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:45:29,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:29,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:45:29,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:45:29,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 04:45:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 04:45:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 04:45:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 04:45:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 04:45:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 04:45:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 04:45:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 04:45:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 04:45:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 04:45:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:45:29,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 04:45:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 04:45:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 04:45:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 04:45:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:45:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:45:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:45:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-27 04:45:30,160 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:45:30,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:30 BoogieIcfgContainer [2018-10-27 04:45:30,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:45:30,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:45:30,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:45:30,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:45:30,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:45:28" (1/3) ... [2018-10-27 04:45:30,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442a6c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:30, skipping insertion in model container [2018-10-27 04:45:30,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:28" (2/3) ... [2018-10-27 04:45:30,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442a6c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:30, skipping insertion in model container [2018-10-27 04:45:30,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:30" (3/3) ... [2018-10-27 04:45:30,169 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-10-27 04:45:30,178 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:45:30,189 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-10-27 04:45:30,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2018-10-27 04:45:30,228 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:45:30,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:45:30,229 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:45:30,229 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:45:30,229 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:45:30,230 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:45:30,230 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:45:30,230 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:45:30,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:45:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-10-27 04:45:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:45:30,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:30,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:30,265 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:30,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash -659694479, now seen corresponding path program 1 times [2018-10-27 04:45:30,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:30,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:30,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:30,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:30,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:30,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:30,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:30,578 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2018-10-27 04:45:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:31,202 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-10-27 04:45:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:31,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:45:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:31,212 INFO L225 Difference]: With dead ends: 141 [2018-10-27 04:45:31,212 INFO L226 Difference]: Without dead ends: 137 [2018-10-27 04:45:31,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-27 04:45:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-10-27 04:45:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-27 04:45:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-10-27 04:45:31,255 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 8 [2018-10-27 04:45:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:31,255 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-10-27 04:45:31,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-10-27 04:45:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:45:31,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:31,256 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:31,256 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:31,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash -659694478, now seen corresponding path program 1 times [2018-10-27 04:45:31,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:31,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:31,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:31,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:31,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:31,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:31,359 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-10-27 04:45:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:31,628 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-10-27 04:45:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:31,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:45:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:31,632 INFO L225 Difference]: With dead ends: 135 [2018-10-27 04:45:31,632 INFO L226 Difference]: Without dead ends: 135 [2018-10-27 04:45:31,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-27 04:45:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-10-27 04:45:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-27 04:45:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-10-27 04:45:31,642 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-10-27 04:45:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:31,643 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-10-27 04:45:31,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-10-27 04:45:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:45:31,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:31,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:31,645 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:31,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash -202425566, now seen corresponding path program 1 times [2018-10-27 04:45:31,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:31,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:31,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:31,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:31,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:31,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:31,722 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2018-10-27 04:45:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:31,956 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-10-27 04:45:31,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:31,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-27 04:45:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:31,959 INFO L225 Difference]: With dead ends: 133 [2018-10-27 04:45:31,959 INFO L226 Difference]: Without dead ends: 133 [2018-10-27 04:45:31,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-27 04:45:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2018-10-27 04:45:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-27 04:45:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-10-27 04:45:31,973 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 15 [2018-10-27 04:45:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:31,974 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-10-27 04:45:31,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-10-27 04:45:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:45:31,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:31,975 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:31,975 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:31,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash -202425565, now seen corresponding path program 1 times [2018-10-27 04:45:31,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:31,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:32,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:32,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:32,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:32,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:32,118 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 5 states. [2018-10-27 04:45:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:32,368 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-10-27 04:45:32,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:32,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 04:45:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:32,370 INFO L225 Difference]: With dead ends: 156 [2018-10-27 04:45:32,370 INFO L226 Difference]: Without dead ends: 156 [2018-10-27 04:45:32,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-27 04:45:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2018-10-27 04:45:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-27 04:45:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-10-27 04:45:32,376 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-10-27 04:45:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:32,377 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-10-27 04:45:32,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-10-27 04:45:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:45:32,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:32,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:32,378 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:32,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash -325956996, now seen corresponding path program 1 times [2018-10-27 04:45:32,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:32,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:32,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:32,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:32,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:32,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:32,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:32,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:32,493 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2018-10-27 04:45:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:32,920 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-10-27 04:45:32,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:32,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-27 04:45:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:32,921 INFO L225 Difference]: With dead ends: 216 [2018-10-27 04:45:32,921 INFO L226 Difference]: Without dead ends: 216 [2018-10-27 04:45:32,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-27 04:45:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 124. [2018-10-27 04:45:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-27 04:45:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-10-27 04:45:32,930 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 18 [2018-10-27 04:45:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:32,930 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-10-27 04:45:32,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-10-27 04:45:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:45:32,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:32,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:32,932 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:32,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash -325956997, now seen corresponding path program 1 times [2018-10-27 04:45:32,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:32,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:32,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:32,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:32,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:32,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:32,980 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2018-10-27 04:45:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:33,214 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-10-27 04:45:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:45:33,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-27 04:45:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:33,216 INFO L225 Difference]: With dead ends: 211 [2018-10-27 04:45:33,216 INFO L226 Difference]: Without dead ends: 211 [2018-10-27 04:45:33,216 INFO L605 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-10-27 04:45:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-27 04:45:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2018-10-27 04:45:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-27 04:45:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-10-27 04:45:33,231 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2018-10-27 04:45:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:33,232 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-10-27 04:45:33,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-10-27 04:45:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:45:33,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:33,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:33,233 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:33,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -765015574, now seen corresponding path program 1 times [2018-10-27 04:45:33,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:33,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:33,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:33,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:33,434 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-10-27 04:45:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:33,867 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2018-10-27 04:45:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:45:33,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-27 04:45:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:33,869 INFO L225 Difference]: With dead ends: 224 [2018-10-27 04:45:33,869 INFO L226 Difference]: Without dead ends: 224 [2018-10-27 04:45:33,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-27 04:45:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 122. [2018-10-27 04:45:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-27 04:45:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-10-27 04:45:33,874 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 26 [2018-10-27 04:45:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:33,874 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-10-27 04:45:33,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-10-27 04:45:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:45:33,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:33,878 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:33,878 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:33,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:33,878 INFO L82 PathProgramCache]: Analyzing trace with hash -765015573, now seen corresponding path program 1 times [2018-10-27 04:45:33,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:33,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:33,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:33,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:33,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:33,992 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-10-27 04:45:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:34,820 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2018-10-27 04:45:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:34,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-27 04:45:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:34,822 INFO L225 Difference]: With dead ends: 217 [2018-10-27 04:45:34,822 INFO L226 Difference]: Without dead ends: 217 [2018-10-27 04:45:34,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:34,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-27 04:45:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 112. [2018-10-27 04:45:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 04:45:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-10-27 04:45:34,826 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 26 [2018-10-27 04:45:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:34,829 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-10-27 04:45:34,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-10-27 04:45:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 04:45:34,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:34,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:34,830 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:34,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:34,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1849046283, now seen corresponding path program 1 times [2018-10-27 04:45:34,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:34,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:34,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:34,876 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2018-10-27 04:45:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:35,040 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-10-27 04:45:35,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:35,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-10-27 04:45:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:35,041 INFO L225 Difference]: With dead ends: 131 [2018-10-27 04:45:35,041 INFO L226 Difference]: Without dead ends: 131 [2018-10-27 04:45:35,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-10-27 04:45:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-27 04:45:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-10-27 04:45:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 04:45:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-10-27 04:45:35,044 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 27 [2018-10-27 04:45:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:35,044 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-10-27 04:45:35,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-10-27 04:45:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:45:35,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:35,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:35,046 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:35,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:35,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1472510335, now seen corresponding path program 1 times [2018-10-27 04:45:35,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:35,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:35,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:35,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:35,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:35,172 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 5 states. [2018-10-27 04:45:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:35,280 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-10-27 04:45:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:35,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-27 04:45:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:35,281 INFO L225 Difference]: With dead ends: 120 [2018-10-27 04:45:35,281 INFO L226 Difference]: Without dead ends: 120 [2018-10-27 04:45:35,282 INFO L605 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-10-27 04:45:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-27 04:45:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-10-27 04:45:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-27 04:45:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-10-27 04:45:35,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 28 [2018-10-27 04:45:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:35,284 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-10-27 04:45:35,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-10-27 04:45:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 04:45:35,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:35,285 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:35,285 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:35,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1101576030, now seen corresponding path program 1 times [2018-10-27 04:45:35,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:35,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:35,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:35,462 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2018-10-27 04:45:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:35,788 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-10-27 04:45:35,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:35,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-10-27 04:45:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:35,789 INFO L225 Difference]: With dead ends: 131 [2018-10-27 04:45:35,790 INFO L226 Difference]: Without dead ends: 116 [2018-10-27 04:45:35,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-27 04:45:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-27 04:45:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-27 04:45:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-10-27 04:45:35,792 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 34 [2018-10-27 04:45:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:35,793 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-10-27 04:45:35,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-10-27 04:45:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:45:35,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:35,794 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:35,794 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:35,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738935, now seen corresponding path program 1 times [2018-10-27 04:45:35,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:35,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:36,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:36,087 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:36,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:36,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:36,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:36,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:36,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:45:36,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-27 04:45:36,280 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:36,287 INFO L477 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-10-27 04:45:36,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-10-27 04:45:36,508 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 04:45:36,524 INFO L477 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 37 treesize of output 33 [2018-10-27 04:45:36,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:45:36,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,552 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-10-27 04:45:36,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-27 04:45:36,756 INFO L477 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-10-27 04:45:36,771 INFO L477 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-10-27 04:45:36,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,799 INFO L477 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-10-27 04:45:36,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:36,819 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-10-27 04:45:36,820 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-10-27 04:45:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:37,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:37,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-10-27 04:45:37,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 04:45:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 04:45:37,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:45:37,001 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 21 states. [2018-10-27 04:45:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:37,879 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-10-27 04:45:37,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:45:37,880 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-10-27 04:45:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:37,881 INFO L225 Difference]: With dead ends: 212 [2018-10-27 04:45:37,881 INFO L226 Difference]: Without dead ends: 212 [2018-10-27 04:45:37,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-10-27 04:45:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-27 04:45:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 146. [2018-10-27 04:45:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-27 04:45:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-10-27 04:45:37,901 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 45 [2018-10-27 04:45:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:37,901 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-10-27 04:45:37,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 04:45:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-10-27 04:45:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:45:37,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:37,902 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:37,903 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:37,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738936, now seen corresponding path program 1 times [2018-10-27 04:45:37,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:37,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:38,355 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 04:45:38,569 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 04:45:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:38,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:38,653 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:38,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:38,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:38,883 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:38,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:38,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:38,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,950 INFO L477 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 6 treesize of output 5 [2018-10-27 04:45:38,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-27 04:45:39,063 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:39,069 INFO L477 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-10-27 04:45:39,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,085 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:39,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:39,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-10-27 04:45:39,145 INFO L477 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 56 treesize of output 52 [2018-10-27 04:45:39,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:45:39,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,163 INFO L477 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-10-27 04:45:39,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:45:39,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,176 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-10-27 04:45:39,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-10-27 04:45:39,275 INFO L477 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-10-27 04:45:39,278 INFO L477 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-10-27 04:45:39,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,325 INFO L477 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-10-27 04:45:39,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,338 INFO L477 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-10-27 04:45:39,356 INFO L477 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-10-27 04:45:39,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,450 INFO L477 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-10-27 04:45:39,451 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:39,455 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-10-27 04:45:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-10-27 04:45:39,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:45:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:45:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:45:39,501 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 17 states. [2018-10-27 04:45:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:40,356 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2018-10-27 04:45:40,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:45:40,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-10-27 04:45:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:40,358 INFO L225 Difference]: With dead ends: 218 [2018-10-27 04:45:40,358 INFO L226 Difference]: Without dead ends: 218 [2018-10-27 04:45:40,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:45:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-27 04:45:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-10-27 04:45:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-27 04:45:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-10-27 04:45:40,362 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 45 [2018-10-27 04:45:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:40,362 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-10-27 04:45:40,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:45:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-10-27 04:45:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:45:40,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:40,367 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:40,367 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1481333305, now seen corresponding path program 1 times [2018-10-27 04:45:40,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:40,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:40,975 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:40,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:41,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:41,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:41,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:41,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-27 04:45:41,103 INFO L477 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-10-27 04:45:41,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:41,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,122 INFO L477 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-10-27 04:45:41,124 INFO L477 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-10-27 04:45:41,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-10-27 04:45:41,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,275 INFO L477 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-10-27 04:45:41,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:45:41,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,298 INFO L477 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-10-27 04:45:41,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:41,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-10-27 04:45:41,367 INFO L477 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-10-27 04:45:41,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,480 INFO L477 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-10-27 04:45:41,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:45:41,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:41,521 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-10-27 04:45:41,816 INFO L477 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-10-27 04:45:41,839 INFO L477 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-10-27 04:45:41,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,880 INFO L477 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-10-27 04:45:41,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,917 INFO L477 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-10-27 04:45:41,919 INFO L477 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-10-27 04:45:41,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,924 INFO L477 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-10-27 04:45:41,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,934 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-10-27 04:45:41,934 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-10-27 04:45:41,985 INFO L477 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-10-27 04:45:41,991 INFO L477 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-10-27 04:45:41,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:41,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:42,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:42,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-10-27 04:45:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:42,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:42,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2018-10-27 04:45:42,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 04:45:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 04:45:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=962, Unknown=1, NotChecked=0, Total=1056 [2018-10-27 04:45:42,109 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 33 states. [2018-10-27 04:45:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:44,494 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-10-27 04:45:44,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:45:44,495 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-10-27 04:45:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:44,496 INFO L225 Difference]: With dead ends: 214 [2018-10-27 04:45:44,496 INFO L226 Difference]: Without dead ends: 214 [2018-10-27 04:45:44,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=344, Invalid=2104, Unknown=2, NotChecked=0, Total=2450 [2018-10-27 04:45:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-27 04:45:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2018-10-27 04:45:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-27 04:45:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-10-27 04:45:44,500 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 49 [2018-10-27 04:45:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:44,500 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-10-27 04:45:44,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 04:45:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-10-27 04:45:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 04:45:44,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:44,501 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:44,501 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:44,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:44,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438270, now seen corresponding path program 1 times [2018-10-27 04:45:44,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:44,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:44,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:44,717 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:44,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:44,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:44,871 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:44,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-10-27 04:45:44,900 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:44,902 INFO L477 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-10-27 04:45:44,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-10-27 04:45:44,926 INFO L477 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-10-27 04:45:44,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:44,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-10-27 04:45:44,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,961 INFO L477 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-10-27 04:45:44,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-10-27 04:45:44,985 INFO L477 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-10-27 04:45:44,988 INFO L477 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-10-27 04:45:44,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-10-27 04:45:45,073 INFO L477 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 57 treesize of output 61 [2018-10-27 04:45:45,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-10-27 04:45:45,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,106 INFO L477 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 37 treesize of output 48 [2018-10-27 04:45:45,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:45,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:45,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 04:45:45,150 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 [2018-10-27 04:45:45,383 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-10-27 04:45:45,393 INFO L477 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-10-27 04:45:45,395 INFO L477 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-10-27 04:45:45,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,416 INFO L477 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 36 treesize of output 31 [2018-10-27 04:45:45,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,431 INFO L477 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-10-27 04:45:45,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:45,447 INFO L477 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 27 [2018-10-27 04:45:45,447 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,463 INFO L477 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-10-27 04:45:45,463 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,480 INFO L477 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-10-27 04:45:45,482 INFO L477 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-10-27 04:45:45,483 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,492 INFO L477 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-10-27 04:45:45,492 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,495 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:45,501 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-10-27 04:45:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:45,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:45,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-10-27 04:45:45,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 04:45:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 04:45:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:45:45,536 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 23 states. [2018-10-27 04:45:46,160 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-10-27 04:45:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:46,549 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-10-27 04:45:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 04:45:46,550 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-10-27 04:45:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:46,551 INFO L225 Difference]: With dead ends: 247 [2018-10-27 04:45:46,551 INFO L226 Difference]: Without dead ends: 247 [2018-10-27 04:45:46,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 04:45:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-27 04:45:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 176. [2018-10-27 04:45:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-27 04:45:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-10-27 04:45:46,555 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 51 [2018-10-27 04:45:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:46,556 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-10-27 04:45:46,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 04:45:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-10-27 04:45:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 04:45:46,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:46,557 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:46,557 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:46,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:46,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438271, now seen corresponding path program 1 times [2018-10-27 04:45:46,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:47,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:47,031 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:47,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:47,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:47,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:45:47,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-27 04:45:47,124 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:47,126 INFO L477 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-10-27 04:45:47,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,140 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:47,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:47,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-10-27 04:45:47,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,230 INFO L477 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-10-27 04:45:47,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:47,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,254 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,257 INFO L477 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-10-27 04:45:47,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:45:47,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-10-27 04:45:47,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,705 INFO L477 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-10-27 04:45:47,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,723 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,725 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,725 INFO L477 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-10-27 04:45:47,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-10-27 04:45:47,882 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:47,886 INFO L477 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-10-27 04:45:47,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 04:45:47,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,921 INFO L477 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-10-27 04:45:47,923 INFO L477 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-10-27 04:45:47,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:47,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:66 [2018-10-27 04:45:48,211 INFO L303 Elim1Store]: Index analysis took 182 ms [2018-10-27 04:45:48,211 INFO L477 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 115 treesize of output 90 [2018-10-27 04:45:48,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:45:48,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:48,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:48,775 INFO L477 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 35 treesize of output 36 [2018-10-27 04:45:48,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:45:48,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:48,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:49,159 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-10-27 04:45:49,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:101 [2018-10-27 04:45:49,683 INFO L477 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-10-27 04:45:49,687 INFO L477 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-10-27 04:45:49,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:49,700 INFO L477 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-10-27 04:45:49,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:49,719 INFO L477 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-10-27 04:45:49,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:49,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:49,738 INFO L477 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-10-27 04:45:49,747 INFO L477 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-10-27 04:45:49,747 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:49,756 INFO L477 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-10-27 04:45:49,756 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:49,758 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:49,765 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-10-27 04:45:49,765 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-10-27 04:45:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:49,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:49,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-10-27 04:45:49,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:45:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:45:49,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-10-27 04:45:49,844 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 31 states. [2018-10-27 04:45:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:51,618 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-10-27 04:45:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 04:45:51,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-10-27 04:45:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:51,622 INFO L225 Difference]: With dead ends: 305 [2018-10-27 04:45:51,622 INFO L226 Difference]: Without dead ends: 305 [2018-10-27 04:45:51,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=366, Invalid=2390, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 04:45:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-27 04:45:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 178. [2018-10-27 04:45:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-27 04:45:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-10-27 04:45:51,628 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 51 [2018-10-27 04:45:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:51,628 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-10-27 04:45:51,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 04:45:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-10-27 04:45:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 04:45:51,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:51,629 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:51,629 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:51,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1776041815, now seen corresponding path program 1 times [2018-10-27 04:45:51,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:51,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:45:51,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:51,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:45:51,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:51,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:51,704 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 6 states. [2018-10-27 04:45:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:51,815 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-10-27 04:45:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:51,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-10-27 04:45:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:51,817 INFO L225 Difference]: With dead ends: 142 [2018-10-27 04:45:51,817 INFO L226 Difference]: Without dead ends: 142 [2018-10-27 04:45:51,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:45:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-27 04:45:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-10-27 04:45:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-27 04:45:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-10-27 04:45:51,820 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 54 [2018-10-27 04:45:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:51,820 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-10-27 04:45:51,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-10-27 04:45:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 04:45:51,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:51,821 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1] [2018-10-27 04:45:51,821 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:51,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1044886106, now seen corresponding path program 2 times [2018-10-27 04:45:51,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:51,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:52,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:52,064 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:52,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:52,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:45:52,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:52,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:52,154 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:52,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:52,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:52,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-10-27 04:45:52,204 INFO L477 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-10-27 04:45:52,206 INFO L477 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-10-27 04:45:52,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,276 INFO L477 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-10-27 04:45:52,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:52,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2018-10-27 04:45:52,360 INFO L477 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-10-27 04:45:52,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:45:52,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,379 INFO L477 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 47 treesize of output 43 [2018-10-27 04:45:52,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:45:52,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-10-27 04:45:52,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:52,543 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:52,545 INFO L477 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-10-27 04:45:52,551 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:52,552 INFO L477 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-10-27 04:45:52,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:52,566 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:52,567 INFO L477 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 15 [2018-10-27 04:45:52,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:52,581 INFO L477 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 23 treesize of output 19 [2018-10-27 04:45:52,582 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:52,583 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-10-27 04:45:52,584 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:52,589 INFO L477 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-10-27 04:45:52,589 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,591 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,596 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-10-27 04:45:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:52,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:52,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2018-10-27 04:45:52,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:45:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:45:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=578, Unknown=2, NotChecked=0, Total=650 [2018-10-27 04:45:52,635 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 26 states. [2018-10-27 04:45:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:53,265 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-10-27 04:45:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:45:53,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-10-27 04:45:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:53,267 INFO L225 Difference]: With dead ends: 151 [2018-10-27 04:45:53,267 INFO L226 Difference]: Without dead ends: 126 [2018-10-27 04:45:53,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=1238, Unknown=2, NotChecked=0, Total=1482 [2018-10-27 04:45:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-27 04:45:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-10-27 04:45:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-27 04:45:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-10-27 04:45:53,270 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-10-27 04:45:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:53,270 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-10-27 04:45:53,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:45:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-10-27 04:45:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 04:45:53,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:53,271 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:53,271 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:53,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070912, now seen corresponding path program 1 times [2018-10-27 04:45:53,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:53,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:53,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:53,619 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:53,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:53,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:53,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:53,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:53,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:45:53,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-27 04:45:53,694 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:53,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:53,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,707 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:53,710 INFO L477 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-10-27 04:45:53,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-10-27 04:45:53,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:53,799 INFO L477 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-10-27 04:45:53,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:45:53,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:53,822 INFO L477 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-10-27 04:45:53,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-10-27 04:45:53,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-10-27 04:45:53,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:53,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:53,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:53,876 INFO L477 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-10-27 04:45:53,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-10-27 04:45:53,980 INFO L477 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-10-27 04:45:53,983 INFO L477 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-10-27 04:45:53,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:54,012 INFO L477 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-10-27 04:45:54,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-10-27 04:45:54,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-10-27 04:45:54,151 INFO L477 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 141 treesize of output 112 [2018-10-27 04:45:54,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-27 04:45:54,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,180 INFO L477 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 115 treesize of output 103 [2018-10-27 04:45:54,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-27 04:45:54,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,202 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-10-27 04:45:54,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:153, output treesize:121 [2018-10-27 04:45:54,467 INFO L477 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-10-27 04:45:54,487 INFO L477 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-10-27 04:45:54,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,507 INFO L477 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-10-27 04:45:54,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,538 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-10-27 04:45:54,539 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-10-27 04:45:54,651 INFO L477 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-10-27 04:45:54,653 INFO L477 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-10-27 04:45:54,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,661 INFO L477 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 22 treesize of output 16 [2018-10-27 04:45:54,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:54,670 INFO L477 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 25 treesize of output 14 [2018-10-27 04:45:54,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:54,683 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-10-27 04:45:54,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-10-27 04:45:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:54,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-10-27 04:45:54,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-27 04:45:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-27 04:45:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 04:45:54,792 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 35 states. [2018-10-27 04:45:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:56,503 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-10-27 04:45:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:45:56,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 55 [2018-10-27 04:45:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:56,505 INFO L225 Difference]: With dead ends: 161 [2018-10-27 04:45:56,506 INFO L226 Difference]: Without dead ends: 161 [2018-10-27 04:45:56,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=326, Invalid=2026, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 04:45:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-27 04:45:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-10-27 04:45:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-27 04:45:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-10-27 04:45:56,509 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-10-27 04:45:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:56,509 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-10-27 04:45:56,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-27 04:45:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-10-27 04:45:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 04:45:56,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:56,510 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:56,510 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:56,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070911, now seen corresponding path program 1 times [2018-10-27 04:45:56,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:56,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:56,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:56,868 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-27 04:45:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:57,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:57,156 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:57,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:57,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:57,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:57,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:57,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:45:57,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-27 04:45:57,256 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:57,257 INFO L477 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-10-27 04:45:57,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,269 INFO L477 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 11 treesize of output 8 [2018-10-27 04:45:57,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:57,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,280 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-10-27 04:45:57,336 INFO L477 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-10-27 04:45:57,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-10-27 04:45:57,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,354 INFO L477 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 30 treesize of output 35 [2018-10-27 04:45:57,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:45:57,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:55 [2018-10-27 04:45:57,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:57,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:57,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:57,401 INFO L477 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 16 treesize of output 13 [2018-10-27 04:45:57,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,414 INFO L477 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-10-27 04:45:57,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-10-27 04:45:57,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-27 04:45:57,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-10-27 04:45:57,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,481 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:57,483 INFO L477 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 45 treesize of output 56 [2018-10-27 04:45:57,486 INFO L477 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 23 [2018-10-27 04:45:57,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2018-10-27 04:45:57,587 INFO L477 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 147 treesize of output 118 [2018-10-27 04:45:57,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-27 04:45:57,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,615 INFO L477 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 123 treesize of output 119 [2018-10-27 04:45:57,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-27 04:45:57,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:57,635 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-10-27 04:45:57,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:115 [2018-10-27 04:45:57,812 INFO L477 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-10-27 04:45:57,835 INFO L477 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 45 treesize of output 37 [2018-10-27 04:45:57,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:58,033 INFO L477 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 54 treesize of output 21 [2018-10-27 04:45:58,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:58,044 INFO L477 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-10-27 04:45:58,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:58,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:58,062 INFO L477 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 30 treesize of output 32 [2018-10-27 04:45:58,064 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:45:58,064 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:58,071 INFO L477 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-10-27 04:45:58,071 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:58,075 INFO L477 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-10-27 04:45:58,075 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:58,077 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:58,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:58,082 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-10-27 04:45:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:58,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:58,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2018-10-27 04:45:58,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:45:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:45:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2018-10-27 04:45:58,126 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 31 states. [2018-10-27 04:45:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:59,048 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-10-27 04:45:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:45:59,049 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-10-27 04:45:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:59,050 INFO L225 Difference]: With dead ends: 159 [2018-10-27 04:45:59,050 INFO L226 Difference]: Without dead ends: 159 [2018-10-27 04:45:59,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2018-10-27 04:45:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-27 04:45:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-10-27 04:45:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-27 04:45:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-10-27 04:45:59,053 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-10-27 04:45:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:59,053 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-10-27 04:45:59,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 04:45:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-10-27 04:45:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 04:45:59,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:59,054 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:59,054 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:45:59,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash -817344126, now seen corresponding path program 3 times [2018-10-27 04:45:59,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:59,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:59,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:59,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:59,237 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:45:59,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:45:59,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:45:59,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:59,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:59,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:59,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:45:59,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:59,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:59,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:59,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-10-27 04:45:59,339 INFO L477 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-10-27 04:45:59,340 INFO L477 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-10-27 04:45:59,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-10-27 04:45:59,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:59,410 INFO L477 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-10-27 04:45:59,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:45:59,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-10-27 04:45:59,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:59,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:59,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:59,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-10-27 04:45:59,487 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:59,489 INFO L477 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-10-27 04:45:59,492 INFO L477 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-10-27 04:45:59,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-10-27 04:45:59,615 INFO L477 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 57 treesize of output 61 [2018-10-27 04:45:59,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-10-27 04:45:59,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-10-27 04:45:59,645 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:59,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:59,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 04:45:59,674 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:81 [2018-10-27 04:45:59,898 INFO L477 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 58 treesize of output 49 [2018-10-27 04:45:59,904 INFO L477 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 36 treesize of output 37 [2018-10-27 04:45:59,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:59,932 INFO L477 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 42 treesize of output 38 [2018-10-27 04:45:59,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,956 INFO L477 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 30 treesize of output 25 [2018-10-27 04:45:59,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,980 INFO L477 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 29 treesize of output 20 [2018-10-27 04:45:59,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:59,982 INFO L477 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 29 treesize of output 20 [2018-10-27 04:45:59,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,001 INFO L477 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 25 treesize of output 16 [2018-10-27 04:46:00,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,024 INFO L477 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 42 treesize of output 30 [2018-10-27 04:46:00,026 INFO L477 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-10-27 04:46:00,026 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,036 INFO L477 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-10-27 04:46:00,036 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,041 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,051 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-10-27 04:46:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:00,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:00,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2018-10-27 04:46:00,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:46:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:46:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-10-27 04:46:00,089 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 31 states. [2018-10-27 04:46:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:01,712 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-10-27 04:46:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:46:01,713 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-10-27 04:46:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:01,714 INFO L225 Difference]: With dead ends: 194 [2018-10-27 04:46:01,714 INFO L226 Difference]: Without dead ends: 194 [2018-10-27 04:46:01,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=409, Invalid=2243, Unknown=0, NotChecked=0, Total=2652 [2018-10-27 04:46:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-27 04:46:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-10-27 04:46:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-27 04:46:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-10-27 04:46:01,717 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-10-27 04:46:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:01,718 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-10-27 04:46:01,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 04:46:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-10-27 04:46:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 04:46:01,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:01,718 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:01,723 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:46:01,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash -817344125, now seen corresponding path program 2 times [2018-10-27 04:46:01,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:01,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:01,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:02,001 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 04:46:02,207 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 04:46:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:02,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:02,457 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/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-10-27 04:46:02,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:46:02,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:46:02,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:02,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:02,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:46:02,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:46:02,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:46:02,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:46:02,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-10-27 04:46:02,546 INFO L477 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 11 treesize of output 8 [2018-10-27 04:46:02,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:46:02,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,581 INFO L477 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 11 treesize of output 8 [2018-10-27 04:46:02,583 INFO L477 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-10-27 04:46:02,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-10-27 04:46:02,656 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,660 INFO L477 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-10-27 04:46:02,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:46:02,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,680 INFO L477 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 56 treesize of output 57 [2018-10-27 04:46:02,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:46:02,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-10-27 04:46:02,743 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,745 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,745 INFO L477 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-10-27 04:46:02,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:46:02,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-10-27 04:46:02,799 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:02,802 INFO L477 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 62 treesize of output 61 [2018-10-27 04:46:02,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 04:46:02,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,835 INFO L477 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-10-27 04:46:02,838 INFO L477 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-10-27 04:46:02,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:61 [2018-10-27 04:46:02,970 INFO L477 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 113 treesize of output 88 [2018-10-27 04:46:02,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:46:02,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:02,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,008 INFO L477 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 35 treesize of output 36 [2018-10-27 04:46:03,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:46:03,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,024 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-10-27 04:46:03,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:96 [2018-10-27 04:46:03,144 INFO L477 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 96 treesize of output 59 [2018-10-27 04:46:03,147 INFO L477 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-10-27 04:46:03,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,159 INFO L477 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-10-27 04:46:03,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:03,168 INFO L477 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 25 treesize of output 14 [2018-10-27 04:46:03,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:03,185 INFO L477 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-10-27 04:46:03,188 INFO L477 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-10-27 04:46:03,188 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,194 INFO L477 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-10-27 04:46:03,194 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,202 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-10-27 04:46:03,203 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-10-27 04:46:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:03,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:03,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-10-27 04:46:03,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-27 04:46:03,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 04:46:03,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2018-10-27 04:46:03,279 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 30 states. [2018-10-27 04:46:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:04,446 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-10-27 04:46:04,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:46:04,448 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-10-27 04:46:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:04,449 INFO L225 Difference]: With dead ends: 200 [2018-10-27 04:46:04,449 INFO L226 Difference]: Without dead ends: 200 [2018-10-27 04:46:04,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=319, Invalid=1937, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 04:46:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-27 04:46:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-10-27 04:46:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-27 04:46:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-10-27 04:46:04,452 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-10-27 04:46:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:04,453 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-10-27 04:46:04,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-27 04:46:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-10-27 04:46:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 04:46:04,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:04,453 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:04,454 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION]=== [2018-10-27 04:46:04,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash 613514207, now seen corresponding path program 1 times [2018-10-27 04:46:04,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:04,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:46:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:46:04,517 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 04:46:04,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:46:04 BoogieIcfgContainer [2018-10-27 04:46:04,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:46:04,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:46:04,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:46:04,560 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:46:04,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:30" (3/4) ... [2018-10-27 04:46:04,566 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 04:46:04,612 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_21e2a91e-835c-41f4-9d81-e0ea33f75201/bin-2019/uautomizer/witness.graphml [2018-10-27 04:46:04,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:46:04,613 INFO L168 Benchmark]: Toolchain (without parser) took 36046.17 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 450.4 MB). Free memory was 959.1 MB in the beginning and 773.7 MB in the end (delta: 185.4 MB). Peak memory consumption was 635.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:04,613 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:46:04,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.02 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 935.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:04,614 INFO L168 Benchmark]: Boogie Preprocessor took 114.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:04,614 INFO L168 Benchmark]: RCFGBuilder took 1122.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:04,614 INFO L168 Benchmark]: TraceAbstraction took 34398.38 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 785.2 MB in the end (delta: 259.3 MB). Peak memory consumption was 594.3 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:04,614 INFO L168 Benchmark]: Witness Printer took 52.30 ms. Allocated memory is still 1.5 GB. Free memory was 785.2 MB in the beginning and 773.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:04,622 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.02 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 935.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1122.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34398.38 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 785.2 MB in the end (delta: 259.3 MB). Peak memory consumption was 594.3 MB. Max. memory is 11.5 GB. * Witness Printer took 52.30 ms. Allocated memory is still 1.5 GB. Free memory was 785.2 MB in the beginning and 773.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. 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] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L996] FCALL list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L997] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L999] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1019] FCALL end->colour = BLACK VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1028] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1039] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] EXPR, FCALL end->colour VAL [end={11:0}, end->colour=0, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1035] end = end->next [L1038] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 49 error locations. UNSAFE Result, 34.3s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 17.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1581 SDtfs, 6258 SDslu, 8301 SDs, 0 SdLazy, 13513 SolverSat, 855 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 928 GetRequests, 411 SyntacticMatches, 34 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1088 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1281 ConstructedInterpolants, 241 QuantifiedInterpolants, 1709977 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1896 ConjunctsInSsa, 430 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 26/216 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...