./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d1a973dcd7009ffcd2eda1338249f4d290fb62a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:47:32,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:47:32,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:47:32,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:47:32,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:47:32,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:47:32,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:47:32,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:47:32,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:47:32,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:47:32,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:47:32,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:47:32,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:47:32,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:47:32,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:47:32,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:47:32,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:47:32,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:47:32,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:47:32,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:47:32,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:47:32,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:47:32,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:47:32,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:47:32,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:47:32,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:47:32,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:47:32,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:47:32,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:47:32,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:47:32,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:47:32,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:47:32,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:47:32,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:47:32,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:47:32,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:47:32,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:47:32,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:47:32,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:47:32,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:47:32,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:47:32,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 02:47:32,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:47:32,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:47:32,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:47:32,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:47:32,839 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:47:32,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:47:32,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:47:32,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:47:32,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:47:32,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:47:32,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:47:32,840 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:47:32,845 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:47:32,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:47:32,845 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:47:32,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:47:32,846 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:47:32,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:47:32,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:47:32,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:47:32,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:47:32,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:47:32,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:47:32,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:47:32,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:47:32,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:47:32,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-memcleanup) ) 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 -> 3d1a973dcd7009ffcd2eda1338249f4d290fb62a [2019-11-28 02:47:33,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:47:33,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:47:33,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:47:33,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:47:33,254 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:47:33,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2019-11-28 02:47:33,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b64c17c/6595062999c94777843660804af2b2db/FLAG92de7b19b [2019-11-28 02:47:33,846 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:47:33,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2019-11-28 02:47:33,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b64c17c/6595062999c94777843660804af2b2db/FLAG92de7b19b [2019-11-28 02:47:34,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b64c17c/6595062999c94777843660804af2b2db [2019-11-28 02:47:34,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:47:34,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:47:34,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:34,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:47:34,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:47:34,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:34,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ebd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34, skipping insertion in model container [2019-11-28 02:47:34,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:34,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:47:34,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:47:34,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:34,774 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:47:34,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:34,902 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:47:34,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34 WrapperNode [2019-11-28 02:47:34,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:34,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:47:34,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:47:34,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:47:34,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:34,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:34,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:34,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:34,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:34,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:35,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... [2019-11-28 02:47:35,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:47:35,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:47:35,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:47:35,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:47:35,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:47:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:47:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:47:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:47:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:47:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:47:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:47:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:47:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:47:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:47:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:47:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:47:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:47:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:47:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:47:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:47:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:47:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:47:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:47:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:47:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:47:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:47:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:47:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:47:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:47:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:47:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:47:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:47:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:47:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:47:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:47:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:47:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:47:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:47:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:47:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:47:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:47:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:47:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:47:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:47:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:47:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:47:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:47:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:47:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:47:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:47:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:47:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:47:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:47:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:47:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:47:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:47:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:47:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:47:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:47:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:47:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:47:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:47:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 02:47:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:47:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:47:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:47:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:47:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:47:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:47:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:47:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:47:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:47:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:47:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:47:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:47:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:47:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:47:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:47:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:47:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:47:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:47:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:47:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:47:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:47:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:47:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:47:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:47:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:47:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:47:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:47:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:47:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:47:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:47:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:47:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:47:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:47:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:47:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:47:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:47:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:47:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:47:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:47:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:47:35,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:47:35,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:47:35,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:47:35,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:47:35,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:47:35,922 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:47:35,922 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 02:47:35,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:35 BoogieIcfgContainer [2019-11-28 02:47:35,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:47:35,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:47:35,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:47:35,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:47:35,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:34" (1/3) ... [2019-11-28 02:47:35,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75db7054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:35, skipping insertion in model container [2019-11-28 02:47:35,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (2/3) ... [2019-11-28 02:47:35,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75db7054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:35, skipping insertion in model container [2019-11-28 02:47:35,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:35" (3/3) ... [2019-11-28 02:47:35,934 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2019-11-28 02:47:35,944 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:47:35,953 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-11-28 02:47:35,967 INFO L249 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-11-28 02:47:35,989 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:47:35,990 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:47:35,990 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:47:35,990 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:47:35,991 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:47:35,991 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:47:35,991 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:47:35,991 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:47:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2019-11-28 02:47:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:36,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:36,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:36,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash -121556121, now seen corresponding path program 1 times [2019-11-28 02:47:36,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:36,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434570887] [2019-11-28 02:47:36,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:36,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434570887] [2019-11-28 02:47:36,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:36,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:36,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223527200] [2019-11-28 02:47:36,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:36,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:36,285 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states. [2019-11-28 02:47:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:36,866 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2019-11-28 02:47:36,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:36,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:36,889 INFO L225 Difference]: With dead ends: 185 [2019-11-28 02:47:36,889 INFO L226 Difference]: Without dead ends: 181 [2019-11-28 02:47:36,898 INFO L630 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 [2019-11-28 02:47:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-28 02:47:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2019-11-28 02:47:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-28 02:47:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2019-11-28 02:47:36,992 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 7 [2019-11-28 02:47:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:36,994 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2019-11-28 02:47:36,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2019-11-28 02:47:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:36,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:36,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:36,996 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash -121556120, now seen corresponding path program 1 times [2019-11-28 02:47:36,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:36,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868862024] [2019-11-28 02:47:36,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:37,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868862024] [2019-11-28 02:47:37,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:37,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:37,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019568700] [2019-11-28 02:47:37,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:37,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:37,127 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 4 states. [2019-11-28 02:47:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:37,523 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2019-11-28 02:47:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:37,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:37,525 INFO L225 Difference]: With dead ends: 178 [2019-11-28 02:47:37,526 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 02:47:37,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 02:47:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2019-11-28 02:47:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-28 02:47:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2019-11-28 02:47:37,540 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 7 [2019-11-28 02:47:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:37,540 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2019-11-28 02:47:37,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2019-11-28 02:47:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 02:47:37,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:37,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:37,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1605620432, now seen corresponding path program 1 times [2019-11-28 02:47:37,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:37,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23721179] [2019-11-28 02:47:37,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:37,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23721179] [2019-11-28 02:47:37,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:37,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:37,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127274122] [2019-11-28 02:47:37,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:37,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:37,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:37,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:37,676 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 5 states. [2019-11-28 02:47:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:38,097 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2019-11-28 02:47:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:38,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 02:47:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:38,105 INFO L225 Difference]: With dead ends: 181 [2019-11-28 02:47:38,105 INFO L226 Difference]: Without dead ends: 181 [2019-11-28 02:47:38,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-28 02:47:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2019-11-28 02:47:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-28 02:47:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2019-11-28 02:47:38,136 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 13 [2019-11-28 02:47:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:38,138 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2019-11-28 02:47:38,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2019-11-28 02:47:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 02:47:38,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:38,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:38,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1605620431, now seen corresponding path program 1 times [2019-11-28 02:47:38,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:38,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162572073] [2019-11-28 02:47:38,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:38,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162572073] [2019-11-28 02:47:38,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:38,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:38,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409576936] [2019-11-28 02:47:38,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:38,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:38,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:38,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:38,269 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand 5 states. [2019-11-28 02:47:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:38,866 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2019-11-28 02:47:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:38,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 02:47:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:38,869 INFO L225 Difference]: With dead ends: 260 [2019-11-28 02:47:38,869 INFO L226 Difference]: Without dead ends: 260 [2019-11-28 02:47:38,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-28 02:47:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2019-11-28 02:47:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-28 02:47:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 266 transitions. [2019-11-28 02:47:38,881 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 266 transitions. Word has length 13 [2019-11-28 02:47:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:38,881 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 266 transitions. [2019-11-28 02:47:38,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 266 transitions. [2019-11-28 02:47:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:47:38,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:38,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:38,883 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1107996775, now seen corresponding path program 1 times [2019-11-28 02:47:38,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:38,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171776586] [2019-11-28 02:47:38,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:38,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171776586] [2019-11-28 02:47:38,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:38,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:38,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735260560] [2019-11-28 02:47:38,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:38,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:38,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:38,928 INFO L87 Difference]: Start difference. First operand 222 states and 266 transitions. Second operand 4 states. [2019-11-28 02:47:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:39,217 INFO L93 Difference]: Finished difference Result 267 states and 314 transitions. [2019-11-28 02:47:39,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:39,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:47:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:39,222 INFO L225 Difference]: With dead ends: 267 [2019-11-28 02:47:39,222 INFO L226 Difference]: Without dead ends: 267 [2019-11-28 02:47:39,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-28 02:47:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 234. [2019-11-28 02:47:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-28 02:47:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 285 transitions. [2019-11-28 02:47:39,233 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 285 transitions. Word has length 15 [2019-11-28 02:47:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:39,234 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 285 transitions. [2019-11-28 02:47:39,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 285 transitions. [2019-11-28 02:47:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:47:39,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:39,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:39,236 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1107976013, now seen corresponding path program 1 times [2019-11-28 02:47:39,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:39,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93223819] [2019-11-28 02:47:39,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:39,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93223819] [2019-11-28 02:47:39,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:39,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:39,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614797654] [2019-11-28 02:47:39,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:39,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:39,319 INFO L87 Difference]: Start difference. First operand 234 states and 285 transitions. Second operand 6 states. [2019-11-28 02:47:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:39,724 INFO L93 Difference]: Finished difference Result 237 states and 284 transitions. [2019-11-28 02:47:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:39,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 02:47:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:39,727 INFO L225 Difference]: With dead ends: 237 [2019-11-28 02:47:39,727 INFO L226 Difference]: Without dead ends: 237 [2019-11-28 02:47:39,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-28 02:47:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-11-28 02:47:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-28 02:47:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 282 transitions. [2019-11-28 02:47:39,736 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 282 transitions. Word has length 15 [2019-11-28 02:47:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:39,737 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 282 transitions. [2019-11-28 02:47:39,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 282 transitions. [2019-11-28 02:47:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:47:39,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:39,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:39,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:39,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1107976012, now seen corresponding path program 1 times [2019-11-28 02:47:39,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:39,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063961839] [2019-11-28 02:47:39,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:39,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063961839] [2019-11-28 02:47:39,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:39,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:39,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631421355] [2019-11-28 02:47:39,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:39,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:39,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:39,839 INFO L87 Difference]: Start difference. First operand 233 states and 282 transitions. Second operand 6 states. [2019-11-28 02:47:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:40,300 INFO L93 Difference]: Finished difference Result 232 states and 279 transitions. [2019-11-28 02:47:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:40,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 02:47:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:40,303 INFO L225 Difference]: With dead ends: 232 [2019-11-28 02:47:40,303 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 02:47:40,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 02:47:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-28 02:47:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 02:47:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 279 transitions. [2019-11-28 02:47:40,312 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 279 transitions. Word has length 15 [2019-11-28 02:47:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:40,312 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 279 transitions. [2019-11-28 02:47:40,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 279 transitions. [2019-11-28 02:47:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:47:40,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:40,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:40,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1811872779, now seen corresponding path program 1 times [2019-11-28 02:47:40,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:40,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322956992] [2019-11-28 02:47:40,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:40,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322956992] [2019-11-28 02:47:40,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:40,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:47:40,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43407158] [2019-11-28 02:47:40,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:40,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:40,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:40,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:40,435 INFO L87 Difference]: Start difference. First operand 232 states and 279 transitions. Second operand 10 states. [2019-11-28 02:47:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:41,110 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2019-11-28 02:47:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:47:41,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-28 02:47:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:41,112 INFO L225 Difference]: With dead ends: 238 [2019-11-28 02:47:41,112 INFO L226 Difference]: Without dead ends: 238 [2019-11-28 02:47:41,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:47:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-28 02:47:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2019-11-28 02:47:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-28 02:47:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 277 transitions. [2019-11-28 02:47:41,126 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 277 transitions. Word has length 19 [2019-11-28 02:47:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:41,126 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 277 transitions. [2019-11-28 02:47:41,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 277 transitions. [2019-11-28 02:47:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:47:41,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:41,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:41,128 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1811872778, now seen corresponding path program 1 times [2019-11-28 02:47:41,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:41,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063694638] [2019-11-28 02:47:41,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:41,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063694638] [2019-11-28 02:47:41,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:41,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:47:41,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746336756] [2019-11-28 02:47:41,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:47:41,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:41,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:47:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:41,326 INFO L87 Difference]: Start difference. First operand 231 states and 277 transitions. Second operand 11 states. [2019-11-28 02:47:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:42,540 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2019-11-28 02:47:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:47:42,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-28 02:47:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:42,542 INFO L225 Difference]: With dead ends: 233 [2019-11-28 02:47:42,542 INFO L226 Difference]: Without dead ends: 233 [2019-11-28 02:47:42,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:47:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-28 02:47:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 218. [2019-11-28 02:47:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-28 02:47:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 260 transitions. [2019-11-28 02:47:42,550 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 260 transitions. Word has length 19 [2019-11-28 02:47:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:42,551 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 260 transitions. [2019-11-28 02:47:42,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:47:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 260 transitions. [2019-11-28 02:47:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:47:42,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:42,552 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:42,553 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash 592662244, now seen corresponding path program 1 times [2019-11-28 02:47:42,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:42,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146474008] [2019-11-28 02:47:42,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:42,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146474008] [2019-11-28 02:47:42,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:42,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:42,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656429351] [2019-11-28 02:47:42,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:42,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:42,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:42,655 INFO L87 Difference]: Start difference. First operand 218 states and 260 transitions. Second operand 5 states. [2019-11-28 02:47:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:43,023 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2019-11-28 02:47:43,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:43,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 02:47:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:43,025 INFO L225 Difference]: With dead ends: 254 [2019-11-28 02:47:43,025 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 02:47:43,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 02:47:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 216. [2019-11-28 02:47:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-28 02:47:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2019-11-28 02:47:43,035 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 28 [2019-11-28 02:47:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:43,035 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2019-11-28 02:47:43,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2019-11-28 02:47:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:47:43,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:43,037 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:43,038 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash -48484397, now seen corresponding path program 1 times [2019-11-28 02:47:43,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:43,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806445941] [2019-11-28 02:47:43,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:43,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806445941] [2019-11-28 02:47:43,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931547755] [2019-11-28 02:47:43,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 02:47:43,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:43,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,521 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 02:47:43,522 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,546 INFO L588 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-28 02:47:43,547 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-28 02:47:43,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:47:43,588 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,599 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,600 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-28 02:47:43,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,709 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-28 02:47:43,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:47:43,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:43,717 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 02:47:43,766 INFO L588 ElimStorePlain]: treesize reduction 137, result has 23.5 percent of original size [2019-11-28 02:47:43,767 INFO L508 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. [2019-11-28 02:47:43,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-11-28 02:47:43,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 110 [2019-11-28 02:47:43,938 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,978 INFO L588 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size [2019-11-28 02:47:43,979 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-11-28 02:47:44,068 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-28 02:47:44,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-11-28 02:47:44,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:44,070 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,093 INFO L588 ElimStorePlain]: treesize reduction 32, result has 51.5 percent of original size [2019-11-28 02:47:44,094 INFO L508 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. [2019-11-28 02:47:44,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-28 02:47:44,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-28 02:47:44,195 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,208 INFO L588 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-28 02:47:44,208 INFO L508 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. [2019-11-28 02:47:44,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-28 02:47:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:44,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:44,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-11-28 02:47:44,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459239972] [2019-11-28 02:47:44,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 02:47:44,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:44,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 02:47:44,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:47:44,248 INFO L87 Difference]: Start difference. First operand 216 states and 256 transitions. Second operand 24 states. [2019-11-28 02:47:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:46,570 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2019-11-28 02:47:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 02:47:46,570 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2019-11-28 02:47:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:46,572 INFO L225 Difference]: With dead ends: 418 [2019-11-28 02:47:46,572 INFO L226 Difference]: Without dead ends: 418 [2019-11-28 02:47:46,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2019-11-28 02:47:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-28 02:47:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 240. [2019-11-28 02:47:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-28 02:47:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 285 transitions. [2019-11-28 02:47:46,584 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 285 transitions. Word has length 34 [2019-11-28 02:47:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:46,584 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 285 transitions. [2019-11-28 02:47:46,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 02:47:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 285 transitions. [2019-11-28 02:47:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:47:46,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:46,586 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:46,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:46,791 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:46,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash -48484396, now seen corresponding path program 1 times [2019-11-28 02:47:46,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:46,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411410098] [2019-11-28 02:47:46,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:47,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411410098] [2019-11-28 02:47:47,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817331426] [2019-11-28 02:47:47,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 02:47:47,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:47,172 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_79|], 1=[|v_#valid_89|]} [2019-11-28 02:47:47,176 INFO L377 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 [2019-11-28 02:47:47,176 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,186 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,195 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:47:47,195 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,203 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,203 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-28 02:47:47,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:47:47,223 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,235 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:47:47,239 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,249 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,250 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,250 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-28 02:47:47,287 INFO L377 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 29 treesize of output 24 [2019-11-28 02:47:47,287 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,307 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,328 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2019-11-28 02:47:47,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:47:47,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:47,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:47,333 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-28 02:47:47,374 INFO L588 ElimStorePlain]: treesize reduction 52, result has 52.3 percent of original size [2019-11-28 02:47:47,375 INFO L508 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. [2019-11-28 02:47:47,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2019-11-28 02:47:47,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,525 INFO L377 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 1 case distinctions, treesize of input 32 treesize of output 60 [2019-11-28 02:47:47,526 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,572 INFO L588 ElimStorePlain]: treesize reduction 20, result has 80.4 percent of original size [2019-11-28 02:47:47,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 125 [2019-11-28 02:47:47,632 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,695 INFO L588 ElimStorePlain]: treesize reduction 40, result has 63.0 percent of original size [2019-11-28 02:47:47,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:47,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:47,699 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:38 [2019-11-28 02:47:47,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:47:47,748 INFO L377 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 50 treesize of output 25 [2019-11-28 02:47:47,748 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,763 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,811 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-28 02:47:47,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 86 [2019-11-28 02:47:47,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:47,814 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,839 INFO L588 ElimStorePlain]: treesize reduction 32, result has 59.5 percent of original size [2019-11-28 02:47:47,840 INFO L508 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. [2019-11-28 02:47:47,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-28 02:47:47,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-28 02:47:47,959 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,977 INFO L588 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-28 02:47:47,979 INFO L377 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 10 [2019-11-28 02:47:47,980 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,985 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:47,986 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:47,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-28 02:47:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:47,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:47,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2019-11-28 02:47:47,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749339553] [2019-11-28 02:47:47,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 02:47:47,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:47,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 02:47:47,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:47:47,996 INFO L87 Difference]: Start difference. First operand 240 states and 285 transitions. Second operand 21 states. [2019-11-28 02:47:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:51,044 INFO L93 Difference]: Finished difference Result 412 states and 464 transitions. [2019-11-28 02:47:51,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 02:47:51,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-28 02:47:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:51,047 INFO L225 Difference]: With dead ends: 412 [2019-11-28 02:47:51,047 INFO L226 Difference]: Without dead ends: 412 [2019-11-28 02:47:51,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=255, Invalid=1148, Unknown=3, NotChecked=0, Total=1406 [2019-11-28 02:47:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-28 02:47:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 240. [2019-11-28 02:47:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-28 02:47:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 284 transitions. [2019-11-28 02:47:51,057 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 284 transitions. Word has length 34 [2019-11-28 02:47:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:51,057 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 284 transitions. [2019-11-28 02:47:51,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 02:47:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 284 transitions. [2019-11-28 02:47:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 02:47:51,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:51,059 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:51,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:51,263 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash 659877601, now seen corresponding path program 1 times [2019-11-28 02:47:51,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:51,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333370603] [2019-11-28 02:47:51,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:51,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333370603] [2019-11-28 02:47:51,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:51,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:51,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937259976] [2019-11-28 02:47:51,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:51,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:51,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:51,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:51,311 INFO L87 Difference]: Start difference. First operand 240 states and 284 transitions. Second operand 4 states. [2019-11-28 02:47:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:51,500 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2019-11-28 02:47:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:51,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-28 02:47:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:51,501 INFO L225 Difference]: With dead ends: 242 [2019-11-28 02:47:51,502 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 02:47:51,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 02:47:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 02:47:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 02:47:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2019-11-28 02:47:51,508 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 36 [2019-11-28 02:47:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:51,508 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2019-11-28 02:47:51,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2019-11-28 02:47:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:47:51,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:51,510 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:51,511 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1129950692, now seen corresponding path program 1 times [2019-11-28 02:47:51,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:51,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695224190] [2019-11-28 02:47:51,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:51,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695224190] [2019-11-28 02:47:51,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:51,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:51,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761232735] [2019-11-28 02:47:51,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:51,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:51,613 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand 8 states. [2019-11-28 02:47:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:52,031 INFO L93 Difference]: Finished difference Result 259 states and 305 transitions. [2019-11-28 02:47:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:47:52,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-11-28 02:47:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:52,033 INFO L225 Difference]: With dead ends: 259 [2019-11-28 02:47:52,034 INFO L226 Difference]: Without dead ends: 259 [2019-11-28 02:47:52,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:47:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-28 02:47:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2019-11-28 02:47:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-28 02:47:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 295 transitions. [2019-11-28 02:47:52,041 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 295 transitions. Word has length 39 [2019-11-28 02:47:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:52,042 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 295 transitions. [2019-11-28 02:47:52,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 295 transitions. [2019-11-28 02:47:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:47:52,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:52,046 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:52,046 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1129891110, now seen corresponding path program 1 times [2019-11-28 02:47:52,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:52,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300551114] [2019-11-28 02:47:52,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:52,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300551114] [2019-11-28 02:47:52,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:52,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:52,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545306140] [2019-11-28 02:47:52,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:52,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:52,096 INFO L87 Difference]: Start difference. First operand 250 states and 295 transitions. Second operand 4 states. [2019-11-28 02:47:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:52,309 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2019-11-28 02:47:52,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:52,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-28 02:47:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:52,312 INFO L225 Difference]: With dead ends: 247 [2019-11-28 02:47:52,312 INFO L226 Difference]: Without dead ends: 247 [2019-11-28 02:47:52,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-28 02:47:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2019-11-28 02:47:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-28 02:47:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 287 transitions. [2019-11-28 02:47:52,319 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 287 transitions. Word has length 39 [2019-11-28 02:47:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:52,319 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 287 transitions. [2019-11-28 02:47:52,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 287 transitions. [2019-11-28 02:47:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:47:52,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:52,321 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:52,321 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1129891109, now seen corresponding path program 1 times [2019-11-28 02:47:52,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:52,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210585102] [2019-11-28 02:47:52,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:52,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210585102] [2019-11-28 02:47:52,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:52,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:52,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178211773] [2019-11-28 02:47:52,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:52,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:52,394 INFO L87 Difference]: Start difference. First operand 246 states and 287 transitions. Second operand 4 states. [2019-11-28 02:47:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:52,618 INFO L93 Difference]: Finished difference Result 242 states and 279 transitions. [2019-11-28 02:47:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:52,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-28 02:47:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:52,620 INFO L225 Difference]: With dead ends: 242 [2019-11-28 02:47:52,620 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 02:47:52,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 02:47:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 02:47:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 02:47:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 279 transitions. [2019-11-28 02:47:52,628 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 279 transitions. Word has length 39 [2019-11-28 02:47:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:52,628 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 279 transitions. [2019-11-28 02:47:52,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 279 transitions. [2019-11-28 02:47:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:47:52,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:52,630 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:52,630 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1948795194, now seen corresponding path program 1 times [2019-11-28 02:47:52,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:52,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215912806] [2019-11-28 02:47:52,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:52,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215912806] [2019-11-28 02:47:52,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:52,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:47:52,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433708927] [2019-11-28 02:47:52,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:52,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:52,718 INFO L87 Difference]: Start difference. First operand 242 states and 279 transitions. Second operand 7 states. [2019-11-28 02:47:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:53,214 INFO L93 Difference]: Finished difference Result 262 states and 300 transitions. [2019-11-28 02:47:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:53,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-11-28 02:47:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:53,217 INFO L225 Difference]: With dead ends: 262 [2019-11-28 02:47:53,217 INFO L226 Difference]: Without dead ends: 262 [2019-11-28 02:47:53,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-28 02:47:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 241. [2019-11-28 02:47:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-28 02:47:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2019-11-28 02:47:53,226 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 39 [2019-11-28 02:47:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:53,226 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2019-11-28 02:47:53,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2019-11-28 02:47:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:47:53,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:53,228 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:53,229 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1948795195, now seen corresponding path program 1 times [2019-11-28 02:47:53,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:53,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724539379] [2019-11-28 02:47:53,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:53,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724539379] [2019-11-28 02:47:53,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224980645] [2019-11-28 02:47:53,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:53,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-28 02:47:53,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:53,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,736 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:47:53,736 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:53,750 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,750 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:53,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-28 02:47:53,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:47:53,761 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:53,771 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:47:53,775 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:53,785 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,786 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:53,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-28 02:47:53,837 INFO L377 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 29 treesize of output 24 [2019-11-28 02:47:53,838 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:53,856 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,885 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 61 [2019-11-28 02:47:53,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:47:53,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:53,888 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-28 02:47:53,925 INFO L588 ElimStorePlain]: treesize reduction 43, result has 52.7 percent of original size [2019-11-28 02:47:53,926 INFO L508 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. [2019-11-28 02:47:53,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2019-11-28 02:47:53,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2019-11-28 02:47:53,990 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:53,995 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:53,996 INFO L508 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. [2019-11-28 02:47:53,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2019-11-28 02:47:54,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:54,067 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-28 02:47:54,068 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:54,091 INFO L588 ElimStorePlain]: treesize reduction 16, result has 68.0 percent of original size [2019-11-28 02:47:54,092 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:54,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-11-28 02:47:54,129 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 02:47:54,129 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 02:47:54,130 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:54,135 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:54,136 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:47:54,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-28 02:47:54,308 INFO L404 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-28 02:47:54,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2019-11-28 02:47:54,311 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:54,323 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:54,328 INFO L377 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 33 treesize of output 17 [2019-11-28 02:47:54,328 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:54,335 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:54,336 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:54,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:11 [2019-11-28 02:47:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:54,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:54,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-11-28 02:47:54,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65794116] [2019-11-28 02:47:54,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 02:47:54,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 02:47:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2019-11-28 02:47:54,394 INFO L87 Difference]: Start difference. First operand 241 states and 278 transitions. Second operand 28 states. [2019-11-28 02:47:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:57,719 INFO L93 Difference]: Finished difference Result 438 states and 494 transitions. [2019-11-28 02:47:57,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 02:47:57,723 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-11-28 02:47:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:57,725 INFO L225 Difference]: With dead ends: 438 [2019-11-28 02:47:57,725 INFO L226 Difference]: Without dead ends: 438 [2019-11-28 02:47:57,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=438, Invalid=2424, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 02:47:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-28 02:47:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 245. [2019-11-28 02:47:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-28 02:47:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 283 transitions. [2019-11-28 02:47:57,735 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 283 transitions. Word has length 39 [2019-11-28 02:47:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:57,735 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 283 transitions. [2019-11-28 02:47:57,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 02:47:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 283 transitions. [2019-11-28 02:47:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:47:57,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:57,737 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:57,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:57,942 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash 199552039, now seen corresponding path program 1 times [2019-11-28 02:47:57,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:57,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073944844] [2019-11-28 02:47:57,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:58,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073944844] [2019-11-28 02:47:58,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:58,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:47:58,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673745726] [2019-11-28 02:47:58,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:58,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:58,022 INFO L87 Difference]: Start difference. First operand 245 states and 283 transitions. Second operand 7 states. [2019-11-28 02:47:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:58,649 INFO L93 Difference]: Finished difference Result 268 states and 307 transitions. [2019-11-28 02:47:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:58,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-28 02:47:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:58,651 INFO L225 Difference]: With dead ends: 268 [2019-11-28 02:47:58,651 INFO L226 Difference]: Without dead ends: 268 [2019-11-28 02:47:58,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-28 02:47:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2019-11-28 02:47:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-28 02:47:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 295 transitions. [2019-11-28 02:47:58,657 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 295 transitions. Word has length 43 [2019-11-28 02:47:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:58,658 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 295 transitions. [2019-11-28 02:47:58,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 295 transitions. [2019-11-28 02:47:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:47:58,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:58,659 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:58,659 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash 199552040, now seen corresponding path program 1 times [2019-11-28 02:47:58,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:58,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461989850] [2019-11-28 02:47:58,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:58,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461989850] [2019-11-28 02:47:58,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872465524] [2019-11-28 02:47:58,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:59,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 02:47:59,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:59,203 INFO L377 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 23 treesize of output 15 [2019-11-28 02:47:59,204 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:59,212 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:59,214 INFO L377 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 28 treesize of output 16 [2019-11-28 02:47:59,215 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:59,219 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:59,219 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:59,219 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-11-28 02:47:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:47:59,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:59,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2019-11-28 02:47:59,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679805958] [2019-11-28 02:47:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:59,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:59,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:47:59,264 INFO L87 Difference]: Start difference. First operand 252 states and 295 transitions. Second operand 6 states. [2019-11-28 02:47:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:59,661 INFO L93 Difference]: Finished difference Result 264 states and 302 transitions. [2019-11-28 02:47:59,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:59,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-28 02:47:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:59,664 INFO L225 Difference]: With dead ends: 264 [2019-11-28 02:47:59,664 INFO L226 Difference]: Without dead ends: 264 [2019-11-28 02:47:59,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:47:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-28 02:47:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2019-11-28 02:47:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-28 02:47:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 290 transitions. [2019-11-28 02:47:59,671 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 290 transitions. Word has length 43 [2019-11-28 02:47:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:59,671 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 290 transitions. [2019-11-28 02:47:59,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 290 transitions. [2019-11-28 02:47:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:47:59,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:59,673 INFO L410 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] [2019-11-28 02:47:59,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:59,878 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:47:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1217603904, now seen corresponding path program 1 times [2019-11-28 02:47:59,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:59,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117834580] [2019-11-28 02:47:59,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:00,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117834580] [2019-11-28 02:48:00,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399571889] [2019-11-28 02:48:00,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:00,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-28 02:48:00,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:00,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,324 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:48:00,324 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,338 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,339 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-28 02:48:00,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:48:00,370 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,379 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:48:00,383 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,392 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,392 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-28 02:48:00,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,474 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 65 [2019-11-28 02:48:00,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:00,476 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 02:48:00,510 INFO L588 ElimStorePlain]: treesize reduction 48, result has 53.8 percent of original size [2019-11-28 02:48:00,513 INFO L377 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 29 treesize of output 24 [2019-11-28 02:48:00,513 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,526 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,526 INFO L508 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. [2019-11-28 02:48:00,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2019-11-28 02:48:00,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 114 [2019-11-28 02:48:00,694 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,749 INFO L588 ElimStorePlain]: treesize reduction 43, result has 61.3 percent of original size [2019-11-28 02:48:00,770 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,770 INFO L377 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 1 case distinctions, treesize of input 35 treesize of output 55 [2019-11-28 02:48:00,771 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,822 INFO L588 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-11-28 02:48:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:00,824 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:36 [2019-11-28 02:48:00,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,902 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-28 02:48:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:00,904 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,928 INFO L588 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-11-28 02:48:00,931 INFO L377 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 46 treesize of output 25 [2019-11-28 02:48:00,932 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,940 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:00,940 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:00,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-11-28 02:48:01,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:01,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-11-28 02:48:01,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:48:01,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:48:01,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:48:01,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:48:01,121 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:48:01,143 INFO L588 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-28 02:48:01,150 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:01,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 02:48:01,151 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:01,156 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:01,157 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:01,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-28 02:48:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:01,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:01,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-11-28 02:48:01,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305748832] [2019-11-28 02:48:01,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 02:48:01,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 02:48:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-11-28 02:48:01,169 INFO L87 Difference]: Start difference. First operand 250 states and 290 transitions. Second operand 29 states. [2019-11-28 02:48:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:04,372 INFO L93 Difference]: Finished difference Result 414 states and 468 transitions. [2019-11-28 02:48:04,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 02:48:04,373 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 43 [2019-11-28 02:48:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:04,375 INFO L225 Difference]: With dead ends: 414 [2019-11-28 02:48:04,375 INFO L226 Difference]: Without dead ends: 414 [2019-11-28 02:48:04,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=365, Invalid=2497, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 02:48:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-28 02:48:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 253. [2019-11-28 02:48:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-28 02:48:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 293 transitions. [2019-11-28 02:48:04,383 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 293 transitions. Word has length 43 [2019-11-28 02:48:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:04,383 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 293 transitions. [2019-11-28 02:48:04,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 02:48:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 293 transitions. [2019-11-28 02:48:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:48:04,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:04,385 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:04,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:04,589 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:48:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2028242710, now seen corresponding path program 1 times [2019-11-28 02:48:04,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:04,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523787395] [2019-11-28 02:48:04,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:04,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523787395] [2019-11-28 02:48:04,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136027123] [2019-11-28 02:48:04,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 02:48:04,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:04,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:04,952 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:48:04,952 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:04,959 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:04,960 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:04,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-11-28 02:48:04,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:48:04,971 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:04,979 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:04,980 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:04,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-28 02:48:05,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:05,028 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2019-11-28 02:48:05,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:05,029 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:05,040 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:05,041 INFO L508 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. [2019-11-28 02:48:05,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-28 02:48:05,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:05,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 109 [2019-11-28 02:48:05,178 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:05,213 INFO L588 ElimStorePlain]: treesize reduction 40, result has 48.7 percent of original size [2019-11-28 02:48:05,214 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:05,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:23 [2019-11-28 02:48:05,285 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-28 02:48:05,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-28 02:48:05,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:05,287 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:05,301 INFO L588 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-11-28 02:48:05,302 INFO L508 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. [2019-11-28 02:48:05,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-28 02:48:05,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:05,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-28 02:48:05,391 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:05,402 INFO L588 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-28 02:48:05,403 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:05,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-28 02:48:05,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:05,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:05,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-28 02:48:05,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813028395] [2019-11-28 02:48:05,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 02:48:05,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:05,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 02:48:05,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:48:05,416 INFO L87 Difference]: Start difference. First operand 253 states and 293 transitions. Second operand 22 states. [2019-11-28 02:48:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:07,896 INFO L93 Difference]: Finished difference Result 404 states and 457 transitions. [2019-11-28 02:48:07,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 02:48:07,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-11-28 02:48:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:07,901 INFO L225 Difference]: With dead ends: 404 [2019-11-28 02:48:07,901 INFO L226 Difference]: Without dead ends: 404 [2019-11-28 02:48:07,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=1506, Unknown=0, NotChecked=0, Total=1806 [2019-11-28 02:48:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-11-28 02:48:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 253. [2019-11-28 02:48:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-28 02:48:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 292 transitions. [2019-11-28 02:48:07,909 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 292 transitions. Word has length 45 [2019-11-28 02:48:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:07,910 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 292 transitions. [2019-11-28 02:48:07,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 02:48:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 292 transitions. [2019-11-28 02:48:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:48:07,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:07,911 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:08,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:08,125 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-11-28 02:48:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:08,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1504015161, now seen corresponding path program 1 times [2019-11-28 02:48:08,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:08,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52776237] [2019-11-28 02:48:08,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:08,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:48:08,234 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:48:08,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:48:08 BoogieIcfgContainer [2019-11-28 02:48:08,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:48:08,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:48:08,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:48:08,303 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:48:08,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:35" (3/4) ... [2019-11-28 02:48:08,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:48:08,354 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:48:08,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:48:08,356 INFO L168 Benchmark]: Toolchain (without parser) took 34175.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 510.7 MB). Free memory was 961.7 MB in the beginning and 1.5 GB in the end (delta: -519.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:08,356 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:08,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,357 INFO L168 Benchmark]: Boogie Preprocessor took 107.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,357 INFO L168 Benchmark]: RCFGBuilder took 907.42 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: 72.8 MB). Peak memory consumption was 72.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,358 INFO L168 Benchmark]: TraceAbstraction took 32377.27 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 392.7 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -461.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:08,358 INFO L168 Benchmark]: Witness Printer took 51.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:08,359 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 720.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 907.42 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: 72.8 MB). Peak memory consumption was 72.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32377.27 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 392.7 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -461.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 51.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1027]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] head->prev = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L989] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L991] SLL* x = head; [L992] int marked = 0; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}] [L995] COND TRUE __VERIFIER_nondet_int() || !marked [L998] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L999] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L999] x->next->prev = x VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1000] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1000] x = x->next [L1001] x->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-2:0}] [L1003] COND TRUE __VERIFIER_nondet_int() [L1005] marked = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-2:0}] [L1008] COND TRUE \read(marked) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-2:0}] [L1009] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-2:0}] [L995] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1014] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-1:0}] [L1016] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-1:0}] [L1017] marked = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L1019] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1019] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1019] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1019] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1, x->next->data=1] [L1019] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1019] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1024] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1024] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1024] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1024] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1026] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1026] x = x->next [L1027] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-2:0}, x->data=1] [L1027] COND TRUE !(x->data != 1) [L1027] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 80 error locations. Result: UNSAFE, OverallTime: 32.2s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2383 SDtfs, 6645 SDslu, 8161 SDs, 0 SdLazy, 14897 SolverSat, 773 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 253 SyntacticMatches, 13 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2727 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 1070 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 834 ConstructedInterpolants, 64 QuantifiedInterpolants, 322085 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1160 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 22/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...