./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:21:43,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:21:43,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:21:43,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:21:43,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:21:43,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:21:43,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:21:43,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:21:43,951 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:21:43,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:21:43,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:21:43,953 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:21:43,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:21:43,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:21:43,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:21:43,958 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:21:43,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:21:43,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:21:43,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:21:43,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:21:43,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:21:43,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:21:43,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:21:43,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:21:43,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:21:43,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:21:43,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:21:43,979 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:21:43,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:21:43,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:21:43,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:21:43,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:21:43,983 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:21:43,983 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:21:43,984 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:21:43,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:21:43,986 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:21:44,011 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:21:44,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:21:44,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:21:44,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:21:44,016 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:21:44,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:21:44,016 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:21:44,016 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:21:44,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:21:44,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:21:44,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:21:44,021 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:21:44,021 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:21:44,022 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:21:44,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:21:44,022 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:21:44,022 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:21:44,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:21:44,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:21:44,025 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:21:44,025 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:21:44,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:21:44,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:21:44,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:21:44,026 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:21:44,026 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:21:44,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 [2019-01-14 00:21:44,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:21:44,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:21:44,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:21:44,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:21:44,095 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:21:44,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:21:44,152 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c99044a7/acc3757bedd1473dbb1cce161eaa17b5/FLAGef4ae32df [2019-01-14 00:21:44,632 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:21:44,633 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:21:44,646 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c99044a7/acc3757bedd1473dbb1cce161eaa17b5/FLAGef4ae32df [2019-01-14 00:21:44,948 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c99044a7/acc3757bedd1473dbb1cce161eaa17b5 [2019-01-14 00:21:44,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:21:44,954 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:21:44,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:21:44,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:21:44,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:21:44,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:21:44" (1/1) ... [2019-01-14 00:21:44,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7cd067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:44, skipping insertion in model container [2019-01-14 00:21:44,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:21:44" (1/1) ... [2019-01-14 00:21:44,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:21:45,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:21:45,441 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:21:45,454 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:21:45,584 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:21:45,642 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:21:45,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45 WrapperNode [2019-01-14 00:21:45,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:21:45,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:21:45,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:21:45,644 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:21:45,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (1/1) ... [2019-01-14 00:21:45,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (1/1) ... [2019-01-14 00:21:45,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (1/1) ... [2019-01-14 00:21:45,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (1/1) ... [2019-01-14 00:21:45,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (1/1) ... [2019-01-14 00:21:45,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (1/1) ... [2019-01-14 00:21:45,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (1/1) ... [2019-01-14 00:21:45,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:21:45,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:21:45,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:21:45,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:21:45,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (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-01-14 00:21:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:21:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:21:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 00:21:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 00:21:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:21:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 00:21:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-14 00:21:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_last [2019-01-14 00:21:45,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:21:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:21:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 00:21:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 00:21:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:21:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:21:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:21:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:21:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:21:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:21:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:21:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:21:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:21:45,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:21:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:21:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:21:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:21:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:21:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:21:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:21:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:21:45,775 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:21:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:21:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:21:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:21:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:21:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:21:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:21:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:21:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:21:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:21:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:21:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:21:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:21:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:21:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:21:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:21:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:21:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:21:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:21:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:21:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:21:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:21:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:21:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:21:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:21:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:21:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:21:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:21:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:21:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:21:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:21:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:21:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:21:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:21:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 00:21:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:21:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:21:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:21:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:21:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:21:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:21:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:21:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:21:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:21:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:21:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:21:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:21:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:21:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:21:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:21:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:21:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 00:21:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:21:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:21:45,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:21:45,803 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-14 00:21:45,803 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_last [2019-01-14 00:21:45,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:21:45,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:21:45,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:21:45,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:21:45,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 00:21:45,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:21:45,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:21:45,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:21:46,206 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:21:46,762 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:21:46,762 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 00:21:46,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:21:46 BoogieIcfgContainer [2019-01-14 00:21:46,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:21:46,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:21:46,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:21:46,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:21:46,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:21:44" (1/3) ... [2019-01-14 00:21:46,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef06e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:21:46, skipping insertion in model container [2019-01-14 00:21:46,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:21:45" (2/3) ... [2019-01-14 00:21:46,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef06e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:21:46, skipping insertion in model container [2019-01-14 00:21:46,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:21:46" (3/3) ... [2019-01-14 00:21:46,775 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:21:46,786 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:21:46,795 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-14 00:21:46,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-14 00:21:46,848 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:21:46,849 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:21:46,849 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:21:46,850 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:21:46,850 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:21:46,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:21:46,851 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:21:46,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:21:46,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:21:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-01-14 00:21:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:21:46,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:46,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:46,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219408, now seen corresponding path program 1 times [2019-01-14 00:21:46,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:46,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:46,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:47,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:21:47,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:21:47,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:21:47,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:21:47,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:21:47,142 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2019-01-14 00:21:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:47,450 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-01-14 00:21:47,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:21:47,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:21:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:47,462 INFO L225 Difference]: With dead ends: 88 [2019-01-14 00:21:47,462 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 00:21:47,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:21:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 00:21:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-14 00:21:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 00:21:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-01-14 00:21:47,504 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 13 [2019-01-14 00:21:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:47,505 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-01-14 00:21:47,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:21:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-01-14 00:21:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:21:47,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:47,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:47,507 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219409, now seen corresponding path program 1 times [2019-01-14 00:21:47,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:47,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:47,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:47,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:47,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:21:47,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:21:47,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:21:47,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:21:47,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:21:47,616 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 3 states. [2019-01-14 00:21:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:47,861 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-14 00:21:47,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:21:47,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:21:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:47,865 INFO L225 Difference]: With dead ends: 79 [2019-01-14 00:21:47,867 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 00:21:47,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:21:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 00:21:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-14 00:21:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:21:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-01-14 00:21:47,891 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 13 [2019-01-14 00:21:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:47,892 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-01-14 00:21:47,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:21:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-01-14 00:21:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 00:21:47,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:47,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:47,894 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:47,895 INFO L82 PathProgramCache]: Analyzing trace with hash -39903579, now seen corresponding path program 1 times [2019-01-14 00:21:47,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:47,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:47,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:47,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:47,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:48,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:21:48,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:21:48,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:21:48,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:21:48,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:21:48,067 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 4 states. [2019-01-14 00:21:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:48,134 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-14 00:21:48,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:21:48,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 00:21:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:48,138 INFO L225 Difference]: With dead ends: 82 [2019-01-14 00:21:48,138 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 00:21:48,139 INFO L631 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-01-14 00:21:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 00:21:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-14 00:21:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 00:21:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-01-14 00:21:48,153 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2019-01-14 00:21:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:48,153 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-01-14 00:21:48,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:21:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-01-14 00:21:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:21:48,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:48,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:48,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:48,155 INFO L82 PathProgramCache]: Analyzing trace with hash 307504148, now seen corresponding path program 1 times [2019-01-14 00:21:48,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:48,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:48,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:48,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:48,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:48,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:21:48,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:21:48,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:21:48,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:21:48,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:21:48,299 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-01-14 00:21:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:48,749 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-01-14 00:21:48,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:21:48,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 00:21:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:48,753 INFO L225 Difference]: With dead ends: 123 [2019-01-14 00:21:48,754 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 00:21:48,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:21:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 00:21:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2019-01-14 00:21:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 00:21:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-01-14 00:21:48,767 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 17 [2019-01-14 00:21:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:48,767 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-01-14 00:21:48,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:21:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-01-14 00:21:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:21:48,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:48,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:48,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash 307504149, now seen corresponding path program 1 times [2019-01-14 00:21:48,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:48,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:48,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:48,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:21:48,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:21:48,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:21:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:21:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:21:48,848 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 5 states. [2019-01-14 00:21:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:48,890 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-14 00:21:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:21:48,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 00:21:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:48,892 INFO L225 Difference]: With dead ends: 89 [2019-01-14 00:21:48,892 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 00:21:48,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-14 00:21:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 00:21:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2019-01-14 00:21:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:21:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-01-14 00:21:48,900 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 17 [2019-01-14 00:21:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:48,900 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-01-14 00:21:48,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:21:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-01-14 00:21:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:21:48,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:48,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:48,902 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash 123258323, now seen corresponding path program 1 times [2019-01-14 00:21:48,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:48,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:49,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:21:49,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:21:49,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:21:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:21:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:21:49,009 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 6 states. [2019-01-14 00:21:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:49,336 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-01-14 00:21:49,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:21:49,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:21:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:49,338 INFO L225 Difference]: With dead ends: 79 [2019-01-14 00:21:49,338 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 00:21:49,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:21:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 00:21:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-01-14 00:21:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 00:21:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-01-14 00:21:49,345 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 19 [2019-01-14 00:21:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:49,346 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-01-14 00:21:49,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:21:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-01-14 00:21:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:21:49,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:49,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:49,347 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash 123258324, now seen corresponding path program 1 times [2019-01-14 00:21:49,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:49,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:49,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:49,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:21:49,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:21:49,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:21:49,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:21:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:21:49,656 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-01-14 00:21:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:50,071 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-01-14 00:21:50,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:21:50,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:21:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:50,075 INFO L225 Difference]: With dead ends: 78 [2019-01-14 00:21:50,075 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 00:21:50,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:21:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 00:21:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-14 00:21:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:21:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-14 00:21:50,083 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2019-01-14 00:21:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:50,084 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-14 00:21:50,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:21:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-14 00:21:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 00:21:50,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:50,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:50,087 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash -616890411, now seen corresponding path program 1 times [2019-01-14 00:21:50,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:50,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:50,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:21:50,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:21:50,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:50,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:21:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:21:50,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:21:50,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 00:21:50,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:21:50,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:21:50,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:21:50,385 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 6 states. [2019-01-14 00:21:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:21:50,452 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-01-14 00:21:50,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:21:50,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-14 00:21:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:21:50,459 INFO L225 Difference]: With dead ends: 91 [2019-01-14 00:21:50,459 INFO L226 Difference]: Without dead ends: 88 [2019-01-14 00:21:50,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:21:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-14 00:21:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-01-14 00:21:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 00:21:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-14 00:21:50,465 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2019-01-14 00:21:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:21:50,466 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-14 00:21:50,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:21:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-14 00:21:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 00:21:50,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:21:50,468 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:21:50,468 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:21:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:21:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767796, now seen corresponding path program 2 times [2019-01-14 00:21:50,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:21:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:21:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:21:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:21:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:21:51,399 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:21:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:21:51,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:21:51,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:21:51,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:21:51,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:21:51,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:21:51,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:21:51,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:21:51,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:21:51,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:21:51,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:21:51,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:21:51,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:21:51,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:21:51,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:21:51,979 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 00:21:52,463 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (< |c_#StackHeapBarrier| v_prenex_1) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |c_#valid|))) is different from true [2019-01-14 00:21:52,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:21:52,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-14 00:21:52,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:21:52,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-14 00:21:52,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:21:52,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:21:52,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:21:52,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-01-14 00:21:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2019-01-14 00:21:52,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:21:52,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-01-14 00:21:52,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 00:21:52,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 00:21:52,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=171, Unknown=2, NotChecked=54, Total=272 [2019-01-14 00:21:52,760 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2019-01-14 00:21:54,027 WARN L181 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-14 00:21:55,207 WARN L181 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-01-14 00:22:00,736 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-01-14 00:22:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:04,832 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-01-14 00:22:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:22:04,833 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-14 00:22:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:04,835 INFO L225 Difference]: With dead ends: 133 [2019-01-14 00:22:04,835 INFO L226 Difference]: Without dead ends: 133 [2019-01-14 00:22:04,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=105, Invalid=388, Unknown=21, NotChecked=86, Total=600 [2019-01-14 00:22:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-14 00:22:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-01-14 00:22:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:22:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-01-14 00:22:04,845 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 43 [2019-01-14 00:22:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:04,845 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-01-14 00:22:04,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 00:22:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-01-14 00:22:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 00:22:04,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:04,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:04,849 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767797, now seen corresponding path program 1 times [2019-01-14 00:22:04,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:04,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:04,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:22:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:05,357 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 00:22:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 00:22:05,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:05,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:05,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:05,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:22:05,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:05,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:05,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 00:22:05,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:22:05,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:05,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:05,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:22:06,107 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#length)| |node_create_#t~malloc2.base| 8) |c_#length|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 00:22:06,613 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:22:07,058 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (sll_create_~new_head~0.base Int)) (and (= (store (store |c_old(#length)| |node_create_#t~malloc2.base| 8) sll_create_~new_head~0.base 8) |c_#length|) (< |c_#StackHeapBarrier| sll_create_~new_head~0.base) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 00:22:07,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:07,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:07,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 00:22:07,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:07,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2019-01-14 00:22:07,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:07,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:07,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:22:07,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-01-14 00:22:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 14 not checked. [2019-01-14 00:22:07,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:07,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2019-01-14 00:22:07,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 00:22:07,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 00:22:07,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2019-01-14 00:22:07,459 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 17 states. [2019-01-14 00:22:09,325 WARN L181 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-14 00:22:13,308 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-14 00:22:15,299 WARN L181 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2019-01-14 00:22:20,032 WARN L181 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-01-14 00:22:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:23,263 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-01-14 00:22:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:22:23,264 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-14 00:22:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:23,266 INFO L225 Difference]: With dead ends: 141 [2019-01-14 00:22:23,267 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 00:22:23,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=98, Invalid=395, Unknown=21, NotChecked=86, Total=600 [2019-01-14 00:22:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 00:22:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2019-01-14 00:22:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 00:22:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-01-14 00:22:23,277 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 43 [2019-01-14 00:22:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:23,277 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-01-14 00:22:23,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 00:22:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-01-14 00:22:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:22:23,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:23,281 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:23,281 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:23,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030653, now seen corresponding path program 1 times [2019-01-14 00:22:23,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:23,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:23,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:23,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:23,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 00:22:23,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:23,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:22:23,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:22:23,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:22:23,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:23,704 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 13 states. [2019-01-14 00:22:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:24,332 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2019-01-14 00:22:24,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:22:24,333 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-14 00:22:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:24,335 INFO L225 Difference]: With dead ends: 165 [2019-01-14 00:22:24,336 INFO L226 Difference]: Without dead ends: 165 [2019-01-14 00:22:24,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-01-14 00:22:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-14 00:22:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 127. [2019-01-14 00:22:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 00:22:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2019-01-14 00:22:24,346 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 44 [2019-01-14 00:22:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:24,346 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2019-01-14 00:22:24,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:22:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2019-01-14 00:22:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:22:24,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:24,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:24,351 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030654, now seen corresponding path program 1 times [2019-01-14 00:22:24,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:24,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:24,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:24,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:22:24,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:24,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:24,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:24,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:25,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:22:25,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 00:22:25,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:25,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:25,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-14 00:22:25,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-14 00:22:25,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:25,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:25,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:25,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:13 [2019-01-14 00:22:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 00:22:25,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:22:25,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2019-01-14 00:22:25,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 00:22:25,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 00:22:25,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-01-14 00:22:25,675 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand 29 states. [2019-01-14 00:22:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:27,450 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2019-01-14 00:22:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:22:27,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-14 00:22:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:27,453 INFO L225 Difference]: With dead ends: 168 [2019-01-14 00:22:27,454 INFO L226 Difference]: Without dead ends: 168 [2019-01-14 00:22:27,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 00:22:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-14 00:22:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 127. [2019-01-14 00:22:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 00:22:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-01-14 00:22:27,463 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 44 [2019-01-14 00:22:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:27,464 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-01-14 00:22:27,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 00:22:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-01-14 00:22:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 00:22:27,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:27,465 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:27,468 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 565846907, now seen corresponding path program 1 times [2019-01-14 00:22:27,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:22:28,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:28,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:22:28,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:22:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:22:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:28,285 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 13 states. [2019-01-14 00:22:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:28,690 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2019-01-14 00:22:28,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:22:28,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-14 00:22:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:28,696 INFO L225 Difference]: With dead ends: 126 [2019-01-14 00:22:28,696 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 00:22:28,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-01-14 00:22:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 00:22:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-14 00:22:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 00:22:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-01-14 00:22:28,708 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 47 [2019-01-14 00:22:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:28,708 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-01-14 00:22:28,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:22:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-01-14 00:22:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:22:28,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:28,710 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:28,710 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash 361816003, now seen corresponding path program 1 times [2019-01-14 00:22:28,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:28,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:28,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:28,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:28,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:22:28,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:28,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:28,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:28,901 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 6 states. [2019-01-14 00:22:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:29,083 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2019-01-14 00:22:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:22:29,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-01-14 00:22:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:29,089 INFO L225 Difference]: With dead ends: 127 [2019-01-14 00:22:29,089 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 00:22:29,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:22:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 00:22:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-14 00:22:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 00:22:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-01-14 00:22:29,098 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 48 [2019-01-14 00:22:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:29,098 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-01-14 00:22:29,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-01-14 00:22:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:22:29,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:29,101 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:29,101 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash 361816004, now seen corresponding path program 1 times [2019-01-14 00:22:29,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:29,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:29,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:22:29,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:29,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:29,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:29,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:29,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:22:29,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 00:22:29,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:29,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:29,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-14 00:22:29,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-14 00:22:29,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:29,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:29,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:29,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-01-14 00:22:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:29,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:22:29,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2019-01-14 00:22:29,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 00:22:29,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 00:22:29,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-01-14 00:22:29,983 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 24 states. [2019-01-14 00:22:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:31,478 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2019-01-14 00:22:31,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 00:22:31,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-01-14 00:22:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:31,480 INFO L225 Difference]: With dead ends: 182 [2019-01-14 00:22:31,480 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 00:22:31,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 00:22:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 00:22:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 125. [2019-01-14 00:22:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 00:22:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2019-01-14 00:22:31,488 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 48 [2019-01-14 00:22:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:31,489 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2019-01-14 00:22:31,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 00:22:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2019-01-14 00:22:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:22:31,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:31,492 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:31,492 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash 361385054, now seen corresponding path program 1 times [2019-01-14 00:22:31,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:31,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:31,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:31,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:31,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:22:31,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:31,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:22:31,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:22:31,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:22:31,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:31,782 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand 13 states. [2019-01-14 00:22:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:32,524 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2019-01-14 00:22:32,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:22:32,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-01-14 00:22:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:32,527 INFO L225 Difference]: With dead ends: 164 [2019-01-14 00:22:32,528 INFO L226 Difference]: Without dead ends: 164 [2019-01-14 00:22:32,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:22:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-14 00:22:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2019-01-14 00:22:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-14 00:22:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2019-01-14 00:22:32,535 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 48 [2019-01-14 00:22:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:32,535 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2019-01-14 00:22:32,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:22:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2019-01-14 00:22:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 00:22:32,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:32,539 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:32,539 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1681965091, now seen corresponding path program 1 times [2019-01-14 00:22:32,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:32,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:32,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:32,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:32,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:32,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:22:32,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:22:32,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:22:32,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:22:32,672 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand 5 states. [2019-01-14 00:22:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:32,797 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-01-14 00:22:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:32,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-14 00:22:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:32,800 INFO L225 Difference]: With dead ends: 132 [2019-01-14 00:22:32,800 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 00:22:32,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 00:22:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-01-14 00:22:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 00:22:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2019-01-14 00:22:32,806 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 49 [2019-01-14 00:22:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:32,808 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2019-01-14 00:22:32,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:22:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2019-01-14 00:22:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 00:22:32,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:32,810 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:32,811 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash -187169459, now seen corresponding path program 1 times [2019-01-14 00:22:32,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:32,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:32,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:32,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:32,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:22:33,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:33,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:33,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:33,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:33,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:22:33,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:22:33,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:33,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:33,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:22:33,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:22:33,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:33,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:33,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:33,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2019-01-14 00:22:34,078 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2019-01-14 00:22:34,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:34,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-01-14 00:22:34,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-14 00:22:34,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-01-14 00:22:34,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:22:34,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:22:34,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:59 [2019-01-14 00:22:34,589 INFO L478 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 34 treesize of output 35 [2019-01-14 00:22:34,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-14 00:22:34,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-01-14 00:22:34,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2019-01-14 00:22:34,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2019-01-14 00:22:34,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-01-14 00:22:34,731 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:34,738 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:71, output treesize:4 [2019-01-14 00:22:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:22:34,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:34,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2019-01-14 00:22:34,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 00:22:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 00:22:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 00:22:34,808 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 38 states. [2019-01-14 00:22:39,550 WARN L181 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-14 00:22:42,926 WARN L181 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-14 00:22:43,119 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-01-14 00:22:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:43,558 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-01-14 00:22:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 00:22:43,559 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2019-01-14 00:22:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:43,561 INFO L225 Difference]: With dead ends: 155 [2019-01-14 00:22:43,561 INFO L226 Difference]: Without dead ends: 155 [2019-01-14 00:22:43,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=274, Invalid=3032, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 00:22:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-14 00:22:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2019-01-14 00:22:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-14 00:22:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2019-01-14 00:22:43,568 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 50 [2019-01-14 00:22:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:43,569 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2019-01-14 00:22:43,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 00:22:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2019-01-14 00:22:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 00:22:43,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:43,569 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:43,570 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash 518831993, now seen corresponding path program 1 times [2019-01-14 00:22:43,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:43,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:43,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:43,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:22:44,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:44,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:44,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:44,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:44,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:22:44,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-14 00:22:44,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:22:44,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:22:44,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-14 00:22:45,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-14 00:22:45,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 00:22:45,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:45,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:45,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:22:45,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2019-01-14 00:22:45,263 INFO L478 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 38 treesize of output 37 [2019-01-14 00:22:45,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-14 00:22:45,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:22:45,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2019-01-14 00:22:45,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:45,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2019-01-14 00:22:45,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:22:45,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:45,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:45,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-14 00:22:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:22:45,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:45,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 37 [2019-01-14 00:22:45,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 00:22:45,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 00:22:45,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1319, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 00:22:45,364 INFO L87 Difference]: Start difference. First operand 134 states and 160 transitions. Second operand 38 states. [2019-01-14 00:22:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:48,757 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2019-01-14 00:22:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 00:22:48,758 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2019-01-14 00:22:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:48,760 INFO L225 Difference]: With dead ends: 158 [2019-01-14 00:22:48,760 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 00:22:48,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 00:22:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 00:22:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2019-01-14 00:22:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-14 00:22:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2019-01-14 00:22:48,768 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 52 [2019-01-14 00:22:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:48,768 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2019-01-14 00:22:48,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 00:22:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2019-01-14 00:22:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 00:22:48,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:48,772 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:48,772 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash 518831994, now seen corresponding path program 1 times [2019-01-14 00:22:48,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:48,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:48,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:48,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:48,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:22:49,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:49,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:49,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:49,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:49,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:22:49,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:49,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:49,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:22:50,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:22:50,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:50,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:50,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-14 00:22:50,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:22:50,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:22:50,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:50,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:50,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:22:50,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:22:50,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:50,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:50,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:50,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-01-14 00:22:51,051 INFO L478 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 80 treesize of output 75 [2019-01-14 00:22:51,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2019-01-14 00:22:51,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:22:51,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2019-01-14 00:22:51,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:22:51,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2019-01-14 00:22:51,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:22:51,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2019-01-14 00:22:51,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2019-01-14 00:22:51,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,254 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,265 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2019-01-14 00:22:51,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-01-14 00:22:51,271 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:22:51,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:51,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-01-14 00:22:51,315 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,336 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,345 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2019-01-14 00:22:51,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:51,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-01-14 00:22:51,353 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,372 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:51,393 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:80, output treesize:9 [2019-01-14 00:22:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:22:51,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-01-14 00:22:51,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 00:22:51,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 00:22:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1968, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 00:22:51,519 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 46 states. [2019-01-14 00:22:54,085 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-01-14 00:22:54,301 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-01-14 00:22:54,595 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-01-14 00:22:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:56,363 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-01-14 00:22:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 00:22:56,365 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-01-14 00:22:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:56,367 INFO L225 Difference]: With dead ends: 178 [2019-01-14 00:22:56,367 INFO L226 Difference]: Without dead ends: 178 [2019-01-14 00:22:56,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=290, Invalid=3742, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 00:22:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-14 00:22:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-01-14 00:22:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 00:22:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 188 transitions. [2019-01-14 00:22:56,373 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 188 transitions. Word has length 52 [2019-01-14 00:22:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:56,373 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 188 transitions. [2019-01-14 00:22:56,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 00:22:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 188 transitions. [2019-01-14 00:22:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 00:22:56,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:56,374 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:56,377 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash 381341571, now seen corresponding path program 1 times [2019-01-14 00:22:56,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:56,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:56,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:56,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:56,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:56,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:56,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:56,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:56,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 00:22:56,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 00:22:56,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:56,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:56,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:56,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-14 00:22:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:56,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:56,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 00:22:56,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:22:56,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:22:56,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:56,705 INFO L87 Difference]: Start difference. First operand 154 states and 188 transitions. Second operand 7 states. [2019-01-14 00:22:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:56,957 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-01-14 00:22:56,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:22:56,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-14 00:22:56,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:56,962 INFO L225 Difference]: With dead ends: 159 [2019-01-14 00:22:56,962 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 00:22:56,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 00:22:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-01-14 00:22:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-14 00:22:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 194 transitions. [2019-01-14 00:22:56,969 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 194 transitions. Word has length 54 [2019-01-14 00:22:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:56,969 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 194 transitions. [2019-01-14 00:22:56,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:22:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2019-01-14 00:22:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 00:22:56,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:56,970 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:56,972 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 381341572, now seen corresponding path program 1 times [2019-01-14 00:22:56,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:56,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:56,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:22:58,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:58,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:22:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:58,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:58,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:22:58,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 00:22:58,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:58,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:58,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 00:22:58,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 00:22:58,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:58,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:58,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:58,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-01-14 00:22:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:58,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:58,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 26 [2019-01-14 00:22:58,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 00:22:58,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 00:22:58,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-14 00:22:58,620 INFO L87 Difference]: Start difference. First operand 158 states and 194 transitions. Second operand 27 states. [2019-01-14 00:23:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:00,268 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2019-01-14 00:23:00,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 00:23:00,273 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-01-14 00:23:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:00,274 INFO L225 Difference]: With dead ends: 178 [2019-01-14 00:23:00,274 INFO L226 Difference]: Without dead ends: 178 [2019-01-14 00:23:00,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2019-01-14 00:23:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-14 00:23:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2019-01-14 00:23:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-14 00:23:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2019-01-14 00:23:00,281 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 54 [2019-01-14 00:23:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:00,283 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2019-01-14 00:23:00,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 00:23:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2019-01-14 00:23:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 00:23:00,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:00,286 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:00,286 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:23:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1600273867, now seen corresponding path program 3 times [2019-01-14 00:23:00,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:00,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 00:23:00,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:00,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:23:00,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:23:00,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 00:23:00,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:23:00,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 00:23:00,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:00,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 00:23:00,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:23:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:23:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:23:00,877 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand 7 states. [2019-01-14 00:23:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:00,976 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-01-14 00:23:00,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:23:00,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-01-14 00:23:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:00,979 INFO L225 Difference]: With dead ends: 106 [2019-01-14 00:23:00,979 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 00:23:00,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:23:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 00:23:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-14 00:23:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:23:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-01-14 00:23:00,984 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 56 [2019-01-14 00:23:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:00,984 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-01-14 00:23:00,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:23:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-01-14 00:23:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 00:23:00,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:00,988 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:00,989 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:23:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1397032643, now seen corresponding path program 1 times [2019-01-14 00:23:00,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:00,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:23:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:23:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:01,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:23:01,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:01,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:01,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:23:01,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:23:01,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 00:23:02,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-14 00:23:02,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 00:23:02,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:02,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-01-14 00:23:02,203 INFO L478 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 29 treesize of output 30 [2019-01-14 00:23:02,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-01-14 00:23:02,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-01-14 00:23:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:23:02,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:02,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 31 [2019-01-14 00:23:02,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 00:23:02,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 00:23:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2019-01-14 00:23:02,255 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2019-01-14 00:23:03,663 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-14 00:23:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:04,988 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-01-14 00:23:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 00:23:04,989 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2019-01-14 00:23:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:04,990 INFO L225 Difference]: With dead ends: 106 [2019-01-14 00:23:04,990 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 00:23:04,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=2062, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 00:23:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 00:23:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-01-14 00:23:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:23:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-01-14 00:23:04,995 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 56 [2019-01-14 00:23:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:04,995 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-01-14 00:23:04,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 00:23:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-01-14 00:23:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 00:23:04,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:04,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:04,997 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:23:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1397085231, now seen corresponding path program 2 times [2019-01-14 00:23:04,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:04,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:04,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:04,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:04,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:05,521 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 00:23:06,535 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-14 00:23:07,143 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-01-14 00:23:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:07,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:07,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:23:07,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:23:07,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:23:07,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:23:07,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:07,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:23:07,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:23:07,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:07,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:07,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:23:07,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:23:07,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:07,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:07,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:07,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-14 00:23:18,320 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:23:22,470 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:23:22,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:22,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:22,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:23:22,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:22,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 00:23:22,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-14 00:23:22,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:22,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 00:23:22,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:22,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:22,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:22,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 00:23:22,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-14 00:23:22,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:22,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 00:23:22,594 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:22,600 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:22,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:22,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:22,623 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:68, output treesize:40 [2019-01-14 00:23:23,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 00:23:23,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 00:23:23,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:23:23,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:23:23,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 00:23:23,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-01-14 00:23:23,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:23,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:23,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:23:23,256 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:111 [2019-01-14 00:23:24,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 130 [2019-01-14 00:23:24,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:24,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2019-01-14 00:23:24,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:24,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 63 [2019-01-14 00:23:24,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:24,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 106 [2019-01-14 00:23:24,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:25,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 80 [2019-01-14 00:23:25,010 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:25,119 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:25,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2019-01-14 00:23:25,121 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:25,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:25,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 102 [2019-01-14 00:23:25,228 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 00:23:25,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:25,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2019-01-14 00:23:25,341 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:25,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 55 [2019-01-14 00:23:25,848 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:25,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2019-01-14 00:23:26,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2019-01-14 00:23:26,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2019-01-14 00:23:26,068 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-14 00:23:26,141 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2019-01-14 00:23:26,190 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-14 00:23:26,226 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,242 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 57 [2019-01-14 00:23:26,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:26,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2019-01-14 00:23:26,282 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,321 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:26,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2019-01-14 00:23:26,322 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2019-01-14 00:23:26,358 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-01-14 00:23:26,400 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-14 00:23:26,451 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,479 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 [2019-01-14 00:23:26,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-01-14 00:23:26,520 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-14 00:23:26,626 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-14 00:23:26,728 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,816 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:26,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:26,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2019-01-14 00:23:26,825 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,880 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:26,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 67 [2019-01-14 00:23:26,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:26,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-01-14 00:23:26,909 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-01-14 00:23:27,002 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-01-14 00:23:27,205 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,252 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:27,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2019-01-14 00:23:27,256 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,298 INFO L267 ElimStorePlain]: Start of recursive call 27: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2019-01-14 00:23:27,309 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:27,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 00:23:27,310 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-14 00:23:27,335 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:27,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:23:27,352 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,362 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:27,412 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 3 variables, input treesize:156, output treesize:7 [2019-01-14 00:23:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:27,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:27,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 50 [2019-01-14 00:23:27,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 00:23:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 00:23:27,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2310, Unknown=24, NotChecked=0, Total=2450 [2019-01-14 00:23:27,516 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 50 states. [2019-01-14 00:23:46,626 WARN L181 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-01-14 00:23:55,114 WARN L181 SmtUtils]: Spent 8.21 s on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2019-01-14 00:23:56,532 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-01-14 00:23:57,186 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-01-14 00:23:57,461 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-01-14 00:23:57,816 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2019-01-14 00:23:58,138 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-01-14 00:23:58,600 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-01-14 00:23:59,254 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-01-14 00:23:59,574 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-01-14 00:24:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:00,413 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-01-14 00:24:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 00:24:00,414 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2019-01-14 00:24:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:00,416 INFO L225 Difference]: With dead ends: 97 [2019-01-14 00:24:00,416 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 00:24:00,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=288, Invalid=4794, Unknown=30, NotChecked=0, Total=5112 [2019-01-14 00:24:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 00:24:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-01-14 00:24:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 00:24:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-14 00:24:00,421 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 56 [2019-01-14 00:24:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:00,421 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-14 00:24:00,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 00:24:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-14 00:24:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 00:24:00,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:00,425 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:24:00,425 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:24:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash -695544581, now seen corresponding path program 1 times [2019-01-14 00:24:00,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:00,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:00,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:24:00,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 00:24:00,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:00,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:24:00,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:00,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 00:24:00,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:00,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 00:24:00,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:24:00,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:24:00,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:24:00,742 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 5 states. [2019-01-14 00:24:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:00,779 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-01-14 00:24:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:24:00,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-01-14 00:24:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:00,783 INFO L225 Difference]: With dead ends: 97 [2019-01-14 00:24:00,783 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 00:24:00,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:24:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 00:24:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-14 00:24:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:24:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-01-14 00:24:00,789 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 62 [2019-01-14 00:24:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:00,794 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-01-14 00:24:00,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:24:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-01-14 00:24:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 00:24:00,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:00,795 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:24:00,795 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:24:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1596693738, now seen corresponding path program 1 times [2019-01-14 00:24:00,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:00,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:24:00,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:00,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:24:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:01,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:01,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:01,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 00:24:01,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 00:24:01,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:24:01,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2019-01-14 00:24:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 00:24:01,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:01,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-01-14 00:24:01,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 00:24:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 00:24:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:24:01,308 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 16 states. [2019-01-14 00:24:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:02,182 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2019-01-14 00:24:02,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:24:02,184 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2019-01-14 00:24:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:02,186 INFO L225 Difference]: With dead ends: 132 [2019-01-14 00:24:02,186 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 00:24:02,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-01-14 00:24:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 00:24:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-01-14 00:24:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 00:24:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-14 00:24:02,192 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 64 [2019-01-14 00:24:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:02,194 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-14 00:24:02,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 00:24:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-14 00:24:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 00:24:02,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:02,195 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:24:02,195 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:24:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2042101625, now seen corresponding path program 1 times [2019-01-14 00:24:02,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:02,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:02,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:24:03,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:03,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:24:03,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:03,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:03,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:03,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:03,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:24:03,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:03,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:03,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 00:24:03,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:24:03,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:24:03,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:03,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:03,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:03,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-14 00:24:05,682 WARN L181 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 00:24:05,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:05,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 51 [2019-01-14 00:24:05,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 00:24:05,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:24:05,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:113 [2019-01-14 00:24:07,062 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 00:24:07,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:07,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2019-01-14 00:24:07,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2019-01-14 00:24:07,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:24:07,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:24:07,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-01-14 00:24:07,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-14 00:24:07,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:07,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:07,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-01-14 00:24:07,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-01-14 00:24:07,214 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:24:07,228 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:24:07,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 00:24:07,264 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:91 [2019-01-14 00:24:07,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:07,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-14 00:24:07,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:24:07,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:07,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2019-01-14 00:24:07,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:07,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:07,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:24:07,741 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:11 [2019-01-14 00:24:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:24:07,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:07,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 53 [2019-01-14 00:24:07,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 00:24:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 00:24:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2711, Unknown=1, NotChecked=0, Total=2862 [2019-01-14 00:24:07,840 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 54 states. [2019-01-14 00:24:14,432 WARN L181 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:24:15,930 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 00:24:17,223 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-01-14 00:24:17,629 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2019-01-14 00:24:24,837 WARN L181 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 00:24:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:27,511 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2019-01-14 00:24:27,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 00:24:27,513 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 65 [2019-01-14 00:24:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:27,515 INFO L225 Difference]: With dead ends: 150 [2019-01-14 00:24:27,516 INFO L226 Difference]: Without dead ends: 150 [2019-01-14 00:24:27,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=569, Invalid=7435, Unknown=6, NotChecked=0, Total=8010 [2019-01-14 00:24:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-14 00:24:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2019-01-14 00:24:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 00:24:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2019-01-14 00:24:27,523 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 65 [2019-01-14 00:24:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:27,524 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2019-01-14 00:24:27,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 00:24:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2019-01-14 00:24:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 00:24:27,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:27,525 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:24:27,525 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:24:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2042101624, now seen corresponding path program 1 times [2019-01-14 00:24:27,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:27,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:27,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:27,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:24:28,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:28,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:24:28,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:28,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:29,313 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 60 [2019-01-14 00:24:29,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-01-14 00:24:29,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 54 [2019-01-14 00:24:29,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:24:29,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:24:29,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:24:29,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:107 [2019-01-14 00:24:29,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:29,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-14 00:24:29,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-14 00:24:29,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:24:29,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:131, output treesize:63 [2019-01-14 00:24:29,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:29,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2019-01-14 00:24:29,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-01-14 00:24:29,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:24:29,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:29,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-01-14 00:24:29,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:24:29,947 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-14 00:24:29,960 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:29,972 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:13 [2019-01-14 00:24:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:24:30,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:30,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2019-01-14 00:24:30,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 00:24:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 00:24:30,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1947, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 00:24:30,052 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 46 states. [2019-01-14 00:24:33,258 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 39 [2019-01-14 00:24:33,505 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 43 [2019-01-14 00:24:34,328 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 45 [2019-01-14 00:24:37,761 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 43 [2019-01-14 00:24:40,331 WARN L181 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-01-14 00:24:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:42,652 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2019-01-14 00:24:42,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-14 00:24:42,653 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-01-14 00:24:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:42,655 INFO L225 Difference]: With dead ends: 158 [2019-01-14 00:24:42,656 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 00:24:42,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=568, Invalid=5912, Unknown=0, NotChecked=0, Total=6480 [2019-01-14 00:24:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 00:24:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2019-01-14 00:24:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 00:24:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2019-01-14 00:24:42,662 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 65 [2019-01-14 00:24:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:42,663 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2019-01-14 00:24:42,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 00:24:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2019-01-14 00:24:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 00:24:42,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:42,664 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:24:42,664 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:24:42,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:42,664 INFO L82 PathProgramCache]: Analyzing trace with hash 701482728, now seen corresponding path program 1 times [2019-01-14 00:24:42,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:42,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:42,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:42,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:42,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:24:43,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:43,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:24:43,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:43,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:43,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-14 00:24:43,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-14 00:24:43,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:43,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:43,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:43,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2019-01-14 00:24:44,142 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_remove_last_~snd_to_last~0.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_remove_last_#in~head.base|) |c_sll_remove_last_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) (+ sll_remove_last_~snd_to_last~0.offset 4) 0))))) is different from true [2019-01-14 00:24:44,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:44,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2019-01-14 00:24:44,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-14 00:24:44,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:44,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:44,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:24:44,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-01-14 00:24:44,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:44,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 00:24:44,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-01-14 00:24:44,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:24:44,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:24:44,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:44,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:44,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:44,331 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2019-01-14 00:24:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:24:44,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:44,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2019-01-14 00:24:44,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 00:24:44,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 00:24:44,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2019-01-14 00:24:44,361 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand 29 states. [2019-01-14 00:24:55,349 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-14 00:25:04,766 WARN L181 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 00:25:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:09,679 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2019-01-14 00:25:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-14 00:25:09,680 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2019-01-14 00:25:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:09,682 INFO L225 Difference]: With dead ends: 157 [2019-01-14 00:25:09,682 INFO L226 Difference]: Without dead ends: 157 [2019-01-14 00:25:09,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=345, Invalid=2593, Unknown=36, NotChecked=106, Total=3080 [2019-01-14 00:25:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-14 00:25:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2019-01-14 00:25:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-14 00:25:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-01-14 00:25:09,688 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 69 [2019-01-14 00:25:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:09,689 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-01-14 00:25:09,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 00:25:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-01-14 00:25:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 00:25:09,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:09,690 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:25:09,690 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:25:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:09,691 INFO L82 PathProgramCache]: Analyzing trace with hash 229180759, now seen corresponding path program 1 times [2019-01-14 00:25:09,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:09,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:09,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:25:10,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:25:10,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:25:10,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:10,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:25:11,142 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 42 [2019-01-14 00:25:11,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-14 00:25:11,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:11,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2019-01-14 00:25:11,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:25:11,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:25:11,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:25:11,204 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:25, output treesize:37 [2019-01-14 00:25:11,262 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 00:25:11,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:11,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-14 00:25:11,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:25:11,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:11,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:11,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:11,290 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:22 [2019-01-14 00:25:12,080 INFO L478 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 71 treesize of output 70 [2019-01-14 00:25:12,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-01-14 00:25:12,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:12,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2019-01-14 00:25:12,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:25:12,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 40 [2019-01-14 00:25:12,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:25:12,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:12,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:12,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:12,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 77 [2019-01-14 00:25:12,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-01-14 00:25:12,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:12,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2019-01-14 00:25:12,395 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2019-01-14 00:25:12,431 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-14 00:25:12,467 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2019-01-14 00:25:12,511 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:25:12,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:25:12,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2019-01-14 00:25:12,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:25:12,683 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 00:25:12,695 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,702 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2019-01-14 00:25:12,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-01-14 00:25:12,723 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 00:25:12,758 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,782 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2019-01-14 00:25:12,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 00:25:12,808 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-01-14 00:25:12,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-14 00:25:12,843 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 00:25:12,876 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,891 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:12,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:12,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2019-01-14 00:25:12,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2019-01-14 00:25:12,986 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:13,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-14 00:25:13,077 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:13,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:25:13,140 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-01-14 00:25:13,200 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:13,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 00:25:13,262 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2019-01-14 00:25:13,323 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:13,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 00:25:13,384 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,461 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:25:13,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:13,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2019-01-14 00:25:13,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2019-01-14 00:25:13,488 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2019-01-14 00:25:13,530 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-01-14 00:25:13,563 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:13,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-14 00:25:13,623 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,647 INFO L267 ElimStorePlain]: Start of recursive call 30: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:25:13,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:13,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2019-01-14 00:25:13,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2019-01-14 00:25:13,679 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2019-01-14 00:25:13,751 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-01-14 00:25:13,868 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:13,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:13,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 00:25:13,945 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:14,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-01-14 00:25:14,033 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:14,118 INFO L267 ElimStorePlain]: Start of recursive call 35: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:25:14,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:25:14,179 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 8 variables, input treesize:143, output treesize:17 [2019-01-14 00:25:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:25:14,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:25:14,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2019-01-14 00:25:14,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-14 00:25:14,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-14 00:25:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=2229, Unknown=0, NotChecked=0, Total=2352 [2019-01-14 00:25:14,238 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 49 states. [2019-01-14 00:25:20,444 WARN L181 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-01-14 00:25:20,949 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 52 [2019-01-14 00:25:21,228 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 51 [2019-01-14 00:25:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:22,400 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2019-01-14 00:25:22,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 00:25:22,401 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 71 [2019-01-14 00:25:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:22,402 INFO L225 Difference]: With dead ends: 136 [2019-01-14 00:25:22,403 INFO L226 Difference]: Without dead ends: 136 [2019-01-14 00:25:22,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=593, Invalid=6209, Unknown=4, NotChecked=0, Total=6806 [2019-01-14 00:25:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-14 00:25:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2019-01-14 00:25:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 00:25:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-01-14 00:25:22,408 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 71 [2019-01-14 00:25:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:22,408 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-01-14 00:25:22,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-14 00:25:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2019-01-14 00:25:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 00:25:22,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:22,409 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:25:22,410 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:25:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash -184959925, now seen corresponding path program 1 times [2019-01-14 00:25:22,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:22,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:22,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:22,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:22,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:23,022 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 00:25:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 00:25:23,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:25:23,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 00:25:23,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:25:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:25:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:25:23,052 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand 9 states. [2019-01-14 00:25:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:23,229 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2019-01-14 00:25:23,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:25:23,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-01-14 00:25:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:23,233 INFO L225 Difference]: With dead ends: 131 [2019-01-14 00:25:23,233 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 00:25:23,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:25:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 00:25:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-01-14 00:25:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 00:25:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-01-14 00:25:23,238 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 71 [2019-01-14 00:25:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:23,239 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-01-14 00:25:23,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:25:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-01-14 00:25:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 00:25:23,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:23,240 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:25:23,240 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:25:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1199432963, now seen corresponding path program 1 times [2019-01-14 00:25:23,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:23,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:23,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:25:24,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:25:24,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:25:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:24,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:25:24,955 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 65 [2019-01-14 00:25:24,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-14 00:25:24,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 60 [2019-01-14 00:25:25,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:25:25,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:25:25,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:25:25,055 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:51, output treesize:82 [2019-01-14 00:25:25,134 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 00:25:25,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:25,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2019-01-14 00:25:25,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-14 00:25:25,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,179 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:106, output treesize:47 [2019-01-14 00:25:25,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:25,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2019-01-14 00:25:25,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2019-01-14 00:25:25,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-01-14 00:25:25,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:25,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:25,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:25,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-14 00:25:25,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 00:25:25,562 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:25,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-14 00:25:25,571 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:25,579 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:78, output treesize:7 [2019-01-14 00:25:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:25:25,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:25:25,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2019-01-14 00:25:25,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 00:25:25,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 00:25:25,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1780, Unknown=4, NotChecked=0, Total=1892 [2019-01-14 00:25:25,659 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 44 states. [2019-01-14 00:25:28,194 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-01-14 00:25:28,454 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 38 [2019-01-14 00:25:28,685 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2019-01-14 00:25:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:28,952 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-01-14 00:25:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 00:25:28,955 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2019-01-14 00:25:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:28,956 INFO L225 Difference]: With dead ends: 119 [2019-01-14 00:25:28,956 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 00:25:28,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=297, Invalid=3605, Unknown=4, NotChecked=0, Total=3906 [2019-01-14 00:25:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 00:25:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-01-14 00:25:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 00:25:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-14 00:25:28,964 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 73 [2019-01-14 00:25:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:28,964 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-14 00:25:28,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 00:25:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-14 00:25:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 00:25:28,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:28,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:25:28,969 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:25:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash -696354863, now seen corresponding path program 1 times [2019-01-14 00:25:28,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:28,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:28,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:29,355 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-14 00:25:29,740 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 00:25:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:25:31,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:25:31,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:25:31,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:31,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:25:32,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:25:32,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 00:25:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:32,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2019-01-14 00:25:32,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:25:32,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-01-14 00:25:32,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:32,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:32,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:48 [2019-01-14 00:25:32,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:25:32,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:25:32,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:32,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:78 [2019-01-14 00:25:35,086 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 00:25:35,773 WARN L181 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:25:35,892 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-14 00:25:35,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:35,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 166 [2019-01-14 00:25:35,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:35,906 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:25:35,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 [2019-01-14 00:25:35,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:35,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:35,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2019-01-14 00:25:35,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2019-01-14 00:25:35,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:35,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:36,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:36,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2019-01-14 00:25:36,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 62 [2019-01-14 00:25:36,062 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:25:36,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:25:36,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 00:25:36,191 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:188, output treesize:191 [2019-01-14 00:25:36,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:36,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:36,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-01-14 00:25:36,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2019-01-14 00:25:36,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:36,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:25:36,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:36,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:36,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:36,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:184, output treesize:58 [2019-01-14 00:25:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:37,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:37,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-14 00:25:37,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:37,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:37,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:56 [2019-01-14 00:25:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 00:25:38,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:25:38,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 54 [2019-01-14 00:25:38,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-14 00:25:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-14 00:25:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2820, Unknown=1, NotChecked=0, Total=2970 [2019-01-14 00:25:38,060 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 55 states. [2019-01-14 00:25:40,589 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2019-01-14 00:25:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:49,011 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-01-14 00:25:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 00:25:49,013 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 78 [2019-01-14 00:25:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:49,014 INFO L225 Difference]: With dead ends: 127 [2019-01-14 00:25:49,015 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 00:25:49,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=286, Invalid=5114, Unknown=2, NotChecked=0, Total=5402 [2019-01-14 00:25:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 00:25:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-14 00:25:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 00:25:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2019-01-14 00:25:49,026 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 78 [2019-01-14 00:25:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:49,028 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2019-01-14 00:25:49,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-14 00:25:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2019-01-14 00:25:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 00:25:49,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:49,029 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:25:49,029 INFO L423 AbstractCegarLoop]: === Iteration 35 === [sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:25:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash -107929965, now seen corresponding path program 1 times [2019-01-14 00:25:49,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:49,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:49,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 00:25:49,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:25:49,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:25:49,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:25:49,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:25:49,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:25:49,231 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 6 states. [2019-01-14 00:25:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:49,314 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-14 00:25:49,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:25:49,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-01-14 00:25:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:49,315 INFO L225 Difference]: With dead ends: 68 [2019-01-14 00:25:49,315 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:25:49,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:25:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:25:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:25:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:25:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:25:49,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-01-14 00:25:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:49,317 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:25:49,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:25:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:25:49,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:25:49,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:25:49 BoogieIcfgContainer [2019-01-14 00:25:49,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:25:49,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:25:49,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:25:49,324 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:25:49,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:21:46" (3/4) ... [2019-01-14 00:25:49,332 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:25:49,341 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:25:49,341 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:25:49,341 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_last [2019-01-14 00:25:49,341 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:25:49,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:25:49,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-14 00:25:49,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:25:49,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 00:25:49,353 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-14 00:25:49,353 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 00:25:49,353 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:25:49,414 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:25:49,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:25:49,416 INFO L168 Benchmark]: Toolchain (without parser) took 244463.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 947.3 MB in the beginning and 813.9 MB in the end (delta: 133.5 MB). Peak memory consumption was 405.6 MB. Max. memory is 11.5 GB. [2019-01-14 00:25:49,418 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:25:49,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:25:49,419 INFO L168 Benchmark]: Boogie Preprocessor took 72.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:25:49,419 INFO L168 Benchmark]: RCFGBuilder took 1048.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:25:49,419 INFO L168 Benchmark]: TraceAbstraction took 242557.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 823.3 MB in the end (delta: 229.2 MB). Peak memory consumption was 369.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:25:49,420 INFO L168 Benchmark]: Witness Printer took 91.30 ms. Allocated memory is still 1.3 GB. Free memory was 823.3 MB in the beginning and 813.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:25:49,428 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1048.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 242557.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 823.3 MB in the end (delta: 229.2 MB). Peak memory consumption was 369.7 MB. Max. memory is 11.5 GB. * Witness Printer took 91.30 ms. Allocated memory is still 1.3 GB. Free memory was 823.3 MB in the beginning and 813.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 97 locations, 31 error locations. SAFE Result, 242.4s OverallTime, 35 OverallIterations, 3 TraceHistogramMax, 171.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1969 SDtfs, 4356 SDslu, 18042 SDs, 0 SdLazy, 25091 SolverSat, 638 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 52.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2070 GetRequests, 984 SyntacticMatches, 43 SemanticMatches, 1043 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9003 ImplicationChecksByTransitivity, 170.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 527 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 67.9s InterpolantComputationTime, 2869 NumberOfCodeBlocks, 2869 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 2813 ConstructedInterpolants, 158 QuantifiedInterpolants, 1831285 SizeOfPredicates, 316 NumberOfNonLiveVariables, 6456 ConjunctsInSsa, 1040 ConjunctsInUnsatCore, 56 InterpolantComputations, 16 PerfectInterpolantSequences, 601/974 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...