./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2n_remove_all_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_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 a3189d7d4e71631c5441bd903e5049703e07b8be ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:22:09,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:22:09,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:22:09,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:22:09,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:22:09,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:22:09,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:22:09,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:22:09,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:22:09,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:22:09,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:22:09,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:22:09,956 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:22:09,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:22:09,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:22:09,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:22:09,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:22:09,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:22:09,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:22:09,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:22:09,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:22:09,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:22:09,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:22:09,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:22:09,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:22:09,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:22:09,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:22:09,976 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:22:09,977 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:22:09,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:22:09,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:22:09,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:22:09,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:22:09,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:22:09,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:22:09,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:22:09,982 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:22:09,998 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:22:09,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:22:09,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:22:09,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:22:09,999 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:22:10,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:22:10,000 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:22:10,001 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:22:10,001 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:22:10,001 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:22:10,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:22:10,001 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:22:10,001 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:22:10,002 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:22:10,002 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:22:10,002 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:22:10,002 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:22:10,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:22:10,003 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:22:10,004 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:22:10,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:22:10,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:22:10,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:22:10,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:22:10,005 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:22:10,006 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:22:10,006 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 -> a3189d7d4e71631c5441bd903e5049703e07b8be [2019-01-14 00:22:10,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:22:10,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:22:10,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:22:10,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:22:10,070 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:22:10,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:22:10,118 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30b8a080/dbe2594fc6e04e4b9d2da9e5f441e863/FLAGded86bd49 [2019-01-14 00:22:10,610 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:22:10,611 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:22:10,628 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30b8a080/dbe2594fc6e04e4b9d2da9e5f441e863/FLAGded86bd49 [2019-01-14 00:22:10,920 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30b8a080/dbe2594fc6e04e4b9d2da9e5f441e863 [2019-01-14 00:22:10,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:22:10,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:22:10,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:22:10,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:22:10,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:22:10,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:22:10" (1/1) ... [2019-01-14 00:22:10,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3c6e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:10, skipping insertion in model container [2019-01-14 00:22:10,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:22:10" (1/1) ... [2019-01-14 00:22:10,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:22:10,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:22:11,430 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:22:11,446 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:22:11,592 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:22:11,656 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:22:11,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11 WrapperNode [2019-01-14 00:22:11,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:22:11,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:22:11,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:22:11,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:22:11,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (1/1) ... [2019-01-14 00:22:11,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (1/1) ... [2019-01-14 00:22:11,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (1/1) ... [2019-01-14 00:22:11,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (1/1) ... [2019-01-14 00:22:11,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (1/1) ... [2019-01-14 00:22:11,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (1/1) ... [2019-01-14 00:22:11,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (1/1) ... [2019-01-14 00:22:11,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:22:11,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:22:11,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:22:11,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:22:11,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (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:22:11,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:22:11,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:22:11,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 00:22:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 00:22:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:22:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 00:22:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-14 00:22:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2019-01-14 00:22:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:22:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:22:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 00:22:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 00:22:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:22:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:22:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:22:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:22:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:22:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:22:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:22:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:22:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:22:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:22:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:22:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:22:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:22:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:22:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:22:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:22:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:22:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:22:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:22:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:22:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:22:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:22:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:22:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:22:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:22:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:22:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:22:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:22:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:22:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:22:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:22:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:22:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:22:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:22:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:22:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:22:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:22:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 00:22:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:22:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:22:11,811 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 00:22:11,812 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:22:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:22:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 00:22:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:22:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:22:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:22:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:22:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:22:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:22:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:22:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:22:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:22:11,821 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:22:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:22:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:22:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:22:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:22:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:22:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:22:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:22:11,823 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 00:22:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:22:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:22:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:22:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-14 00:22:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2019-01-14 00:22:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:22:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:22:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:22:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:22:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 00:22:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:22:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:22:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:22:12,201 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:22:12,561 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:22:12,561 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 00:22:12,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:22:12 BoogieIcfgContainer [2019-01-14 00:22:12,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:22:12,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:22:12,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:22:12,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:22:12,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:22:10" (1/3) ... [2019-01-14 00:22:12,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791f58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:22:12, skipping insertion in model container [2019-01-14 00:22:12,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:11" (2/3) ... [2019-01-14 00:22:12,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791f58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:22:12, skipping insertion in model container [2019-01-14 00:22:12,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:22:12" (3/3) ... [2019-01-14 00:22:12,573 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:22:12,580 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:22:12,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-14 00:22:12,601 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-14 00:22:12,627 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:22:12,628 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:22:12,628 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:22:12,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:22:12,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:22:12,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:22:12,630 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:22:12,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:22:12,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:22:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-01-14 00:22:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:22:12,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:12,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:12,663 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367829, now seen corresponding path program 1 times [2019-01-14 00:22:12,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:12,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:12,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:12,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:12,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:12,870 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:22:12,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:12,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:22:12,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:22:12,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:22:12,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:22:12,898 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2019-01-14 00:22:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:13,125 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-01-14 00:22:13,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:22:13,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:22:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:13,138 INFO L225 Difference]: With dead ends: 67 [2019-01-14 00:22:13,138 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 00:22:13,140 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:22:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 00:22:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-14 00:22:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 00:22:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-14 00:22:13,181 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 13 [2019-01-14 00:22:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:13,182 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-14 00:22:13,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:22:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-14 00:22:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:22:13,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:13,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:13,184 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:13,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367828, now seen corresponding path program 1 times [2019-01-14 00:22:13,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:13,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:13,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:13,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:13,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:13,294 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:22:13,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:13,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:22:13,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:22:13,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:22:13,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:22:13,298 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 3 states. [2019-01-14 00:22:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:13,373 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-01-14 00:22:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:22:13,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:22:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:13,378 INFO L225 Difference]: With dead ends: 58 [2019-01-14 00:22:13,378 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 00:22:13,379 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:22:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 00:22:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-14 00:22:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 00:22:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-01-14 00:22:13,387 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 13 [2019-01-14 00:22:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:13,387 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-01-14 00:22:13,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:22:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-01-14 00:22:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 00:22:13,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:13,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:13,389 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:13,389 INFO L82 PathProgramCache]: Analyzing trace with hash -247912000, now seen corresponding path program 1 times [2019-01-14 00:22:13,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:13,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:13,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:13,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:13,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:13,453 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:22:13,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:13,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:22:13,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:22:13,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:22:13,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:22:13,455 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 4 states. [2019-01-14 00:22:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:13,500 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-01-14 00:22:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:22:13,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 00:22:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:13,504 INFO L225 Difference]: With dead ends: 61 [2019-01-14 00:22:13,505 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 00:22:13,505 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:22:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 00:22:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-14 00:22:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 00:22:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-14 00:22:13,517 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 15 [2019-01-14 00:22:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:13,518 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-14 00:22:13,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:22:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-14 00:22:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:22:13,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:13,520 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:22:13,520 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2020128309, now seen corresponding path program 1 times [2019-01-14 00:22:13,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:13,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:13,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:13,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:13,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:13,709 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:22:13,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:13,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:22:13,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:22:13,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:22:13,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:22:13,717 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2019-01-14 00:22:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:14,003 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-01-14 00:22:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:22:14,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 00:22:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:14,006 INFO L225 Difference]: With dead ends: 70 [2019-01-14 00:22:14,006 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 00:22:14,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 00:22:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-01-14 00:22:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 00:22:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-14 00:22:14,014 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 17 [2019-01-14 00:22:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:14,014 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-14 00:22:14,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:22:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-14 00:22:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:22:14,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:14,016 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:22:14,016 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash -278961335, now seen corresponding path program 1 times [2019-01-14 00:22:14,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:14,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:14,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:14,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:14,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:14,206 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:22:14,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:14,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:22:14,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:14,208 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 6 states. [2019-01-14 00:22:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:14,411 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-14 00:22:14,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:14,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:22:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:14,416 INFO L225 Difference]: With dead ends: 60 [2019-01-14 00:22:14,416 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 00:22:14,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 00:22:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-01-14 00:22:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 00:22:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-14 00:22:14,424 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 19 [2019-01-14 00:22:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:14,425 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-14 00:22:14,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-14 00:22:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:22:14,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:14,426 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:22:14,426 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:14,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -278961334, now seen corresponding path program 1 times [2019-01-14 00:22:14,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:14,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:14,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:14,608 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:22:14,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:14,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:22:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:14,611 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 6 states. [2019-01-14 00:22:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:14,836 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-01-14 00:22:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:14,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:22:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:14,838 INFO L225 Difference]: With dead ends: 59 [2019-01-14 00:22:14,838 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 00:22:14,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 00:22:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-14 00:22:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 00:22:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-01-14 00:22:14,845 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 19 [2019-01-14 00:22:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:14,845 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-01-14 00:22:14,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-01-14 00:22:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 00:22:14,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:14,847 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:22:14,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 312386304, now seen corresponding path program 1 times [2019-01-14 00:22:14,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:14,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:14,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:14,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:14,994 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:22:14,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:14,995 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:22:15,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:15,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:15,104 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:22:15,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:15,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 00:22:15,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:15,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:15,132 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 6 states. [2019-01-14 00:22:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:15,225 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-01-14 00:22:15,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:15,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-14 00:22:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:15,228 INFO L225 Difference]: With dead ends: 72 [2019-01-14 00:22:15,229 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 00:22:15,231 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:22:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 00:22:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-01-14 00:22:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 00:22:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-01-14 00:22:15,243 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2019-01-14 00:22:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:15,244 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-01-14 00:22:15,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-01-14 00:22:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 00:22:15,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:15,248 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:15,248 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:15,249 INFO L82 PathProgramCache]: Analyzing trace with hash -923097109, now seen corresponding path program 2 times [2019-01-14 00:22:15,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:15,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:15,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:15,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:15,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:15,878 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:15,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:15,878 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:22:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:22:15,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:22:15,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:22:15,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:16,011 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:16,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:16,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:16,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 00:22:16,064 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:16,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:16,075 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:16,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:22:16,421 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:16,887 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (store (store |c_old(#length)| |node_create_#t~malloc2.base| 8) v_prenex_1 8) |c_#length|) (< |c_#StackHeapBarrier| v_prenex_1) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 00:22:16,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:16,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:16,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:16,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:16,936 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:16,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:16,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:17,050 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:17,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-01-14 00:22:17,266 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:22:17,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:17,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 00:22:17,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 00:22:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 00:22:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=106, Unknown=2, NotChecked=42, Total=182 [2019-01-14 00:22:17,295 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 14 states. [2019-01-14 00:22:18,820 WARN L181 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2019-01-14 00:22:21,922 WARN L181 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-01-14 00:22:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:23,970 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-01-14 00:22:23,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:22:23,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-01-14 00:22:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:23,973 INFO L225 Difference]: With dead ends: 101 [2019-01-14 00:22:23,973 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 00:22:23,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=61, Invalid=207, Unknown=12, NotChecked=62, Total=342 [2019-01-14 00:22:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 00:22:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2019-01-14 00:22:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 00:22:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2019-01-14 00:22:23,984 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 43 [2019-01-14 00:22:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:23,985 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2019-01-14 00:22:23,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 00:22:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2019-01-14 00:22:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 00:22:23,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:23,986 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:23,987 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash -923097110, now seen corresponding path program 1 times [2019-01-14 00:22:23,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:23,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:23,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:22:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:24,749 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:22:24,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:24,749 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:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:24,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:24,813 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:24,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:24,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:24,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:22:24,857 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:24,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:24,864 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:24,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:22:25,211 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:22:25,765 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:22:26,210 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (sll_create_~new_head~0.base Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~new_head~0.base 1)) (< |c_#StackHeapBarrier| sll_create_~new_head~0.base) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 00:22:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:26,237 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:22:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:26,259 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:22:26,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:26,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:26,544 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:26,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-01-14 00:22:26,660 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:26,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:26,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-14 00:22:26,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 00:22:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 00:22:26,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=252, Unknown=2, NotChecked=66, Total=380 [2019-01-14 00:22:26,680 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand 20 states. [2019-01-14 00:22:27,989 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 00:22:29,936 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 00:22:31,635 WARN L181 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-01-14 00:22:38,135 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-01-14 00:22:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:42,350 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2019-01-14 00:22:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 00:22:42,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-01-14 00:22:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:42,352 INFO L225 Difference]: With dead ends: 104 [2019-01-14 00:22:42,352 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 00:22:42,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=145, Invalid=596, Unknown=23, NotChecked=106, Total=870 [2019-01-14 00:22:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 00:22:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2019-01-14 00:22:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 00:22:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2019-01-14 00:22:42,366 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 43 [2019-01-14 00:22:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:42,367 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2019-01-14 00:22:42,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 00:22:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2019-01-14 00:22:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:22:42,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:42,368 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:42,370 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1448760713, now seen corresponding path program 1 times [2019-01-14 00:22:42,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:42,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:42,574 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:42,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:42,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:22:42,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:22:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:22:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:42,575 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 13 states. [2019-01-14 00:22:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:42,987 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2019-01-14 00:22:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:22:42,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-14 00:22:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:42,990 INFO L225 Difference]: With dead ends: 114 [2019-01-14 00:22:42,990 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 00:22:42,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-01-14 00:22:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 00:22:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2019-01-14 00:22:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:22:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2019-01-14 00:22:43,001 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 44 [2019-01-14 00:22:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:43,002 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2019-01-14 00:22:43,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:22:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2019-01-14 00:22:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:22:43,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:43,010 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:43,011 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:43,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1448760714, now seen corresponding path program 1 times [2019-01-14 00:22:43,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:43,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:43,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:43,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:43,509 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:43,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:43,509 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:43,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:43,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:44,030 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:44,034 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:44,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,036 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,054 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:44,058 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:44,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:44,066 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:44,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:13 [2019-01-14 00:22:44,119 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:44,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:22:44,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2019-01-14 00:22:44,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 00:22:44,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 00:22:44,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-01-14 00:22:44,139 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 29 states. [2019-01-14 00:22:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:45,695 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2019-01-14 00:22:45,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:22:45,696 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-14 00:22:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:45,698 INFO L225 Difference]: With dead ends: 117 [2019-01-14 00:22:45,698 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 00:22:45,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 00:22:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 00:22:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2019-01-14 00:22:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:22:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-01-14 00:22:45,706 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 44 [2019-01-14 00:22:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:45,706 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-01-14 00:22:45,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 00:22:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-01-14 00:22:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 00:22:45,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:45,707 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:45,708 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:45,708 INFO L82 PathProgramCache]: Analyzing trace with hash -95902865, now seen corresponding path program 1 times [2019-01-14 00:22:45,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:45,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:45,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:45,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:45,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:46,348 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:46,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:46,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:22:46,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:22:46,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:22:46,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:46,350 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 13 states. [2019-01-14 00:22:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:46,975 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-01-14 00:22:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:22:46,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-14 00:22:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:46,978 INFO L225 Difference]: With dead ends: 116 [2019-01-14 00:22:46,978 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 00:22:46,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-01-14 00:22:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 00:22:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2019-01-14 00:22:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 00:22:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2019-01-14 00:22:46,985 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 47 [2019-01-14 00:22:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:46,986 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2019-01-14 00:22:46,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:22:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2019-01-14 00:22:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:22:46,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:46,987 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:46,987 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1321978602, now seen corresponding path program 1 times [2019-01-14 00:22:46,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:46,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:46,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:47,216 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:47,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:47,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:22:47,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:22:47,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:22:47,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:47,217 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 13 states. [2019-01-14 00:22:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:47,626 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-01-14 00:22:47,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:22:47,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-01-14 00:22:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:47,630 INFO L225 Difference]: With dead ends: 115 [2019-01-14 00:22:47,630 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 00:22:47,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:22:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 00:22:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2019-01-14 00:22:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 00:22:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2019-01-14 00:22:47,635 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 48 [2019-01-14 00:22:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:47,636 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2019-01-14 00:22:47,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:22:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2019-01-14 00:22:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 00:22:47,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:47,637 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:47,637 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:47,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:47,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1968336175, now seen corresponding path program 1 times [2019-01-14 00:22:47,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:47,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:47,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:47,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:47,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:47,743 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:47,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:47,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:22:47,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:22:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:22:47,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:22:47,745 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 5 states. [2019-01-14 00:22:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:47,839 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-01-14 00:22:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:47,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-14 00:22:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:47,842 INFO L225 Difference]: With dead ends: 104 [2019-01-14 00:22:47,843 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 00:22:47,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 00:22:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-14 00:22:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:22:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-01-14 00:22:47,848 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 49 [2019-01-14 00:22:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:47,849 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-01-14 00:22:47,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:22:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-01-14 00:22:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 00:22:47,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:47,850 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:47,850 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash -888879155, now seen corresponding path program 1 times [2019-01-14 00:22:47,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:47,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:48,362 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:22:48,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:48,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 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:48,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:48,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:48,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:48,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:48,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 00:22:48,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:48,650 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 1 xjuncts. [2019-01-14 00:22:48,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-01-14 00:22:48,701 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:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:22:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [20] total 26 [2019-01-14 00:22:48,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 00:22:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 00:22:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2019-01-14 00:22:48,721 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 27 states. [2019-01-14 00:22:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:50,156 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2019-01-14 00:22:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 00:22:50,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-01-14 00:22:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:50,159 INFO L225 Difference]: With dead ends: 109 [2019-01-14 00:22:50,159 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 00:22:50,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=276, Invalid=2174, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 00:22:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 00:22:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-01-14 00:22:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 00:22:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2019-01-14 00:22:50,169 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 50 [2019-01-14 00:22:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:50,169 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2019-01-14 00:22:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 00:22:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2019-01-14 00:22:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 00:22:50,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:50,172 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, 1, 1, 1] [2019-01-14 00:22:50,173 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1837440975, now seen corresponding path program 1 times [2019-01-14 00:22:50,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:50,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:50,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:50,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:50,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:22:50,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:22:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:22:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:22:50,356 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 5 states. [2019-01-14 00:22:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:50,436 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-01-14 00:22:50,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:50,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-01-14 00:22:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:50,439 INFO L225 Difference]: With dead ends: 103 [2019-01-14 00:22:50,439 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 00:22:50,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 00:22:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-14 00:22:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 00:22:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-01-14 00:22:50,445 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 55 [2019-01-14 00:22:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:50,445 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-01-14 00:22:50,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:22:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-01-14 00:22:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 00:22:50,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:50,448 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:22:50,449 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash 366819552, now seen corresponding path program 3 times [2019-01-14 00:22:50,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:50,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:50,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:50,906 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:22:50,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:50,907 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:50,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:22:51,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 00:22:51,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:22:51,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:51,118 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:22:51,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:51,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 00:22:51,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:22:51,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:22:51,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:51,149 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 7 states. [2019-01-14 00:22:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:51,310 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-01-14 00:22:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:22:51,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-01-14 00:22:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:51,312 INFO L225 Difference]: With dead ends: 72 [2019-01-14 00:22:51,313 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 00:22:51,314 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:22:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 00:22:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 00:22:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:22:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-14 00:22:51,319 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 56 [2019-01-14 00:22:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:51,319 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-14 00:22:51,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:22:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-14 00:22:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 00:22:51,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:51,323 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, 1, 1, 1, 1, 1] [2019-01-14 00:22:51,324 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:51,324 INFO L82 PathProgramCache]: Analyzing trace with hash 549219633, now seen corresponding path program 1 times [2019-01-14 00:22:51,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:51,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:51,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:51,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:22:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:51,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:51,481 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:51,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:51,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:22:51,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:51,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 00:22:51,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:22:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:22:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:22:51,577 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2019-01-14 00:22:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:51,623 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-01-14 00:22:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:22:51,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-14 00:22:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:51,627 INFO L225 Difference]: With dead ends: 65 [2019-01-14 00:22:51,627 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 00:22:51,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 00:22:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-14 00:22:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 00:22:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-01-14 00:22:51,633 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 57 [2019-01-14 00:22:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:51,633 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-01-14 00:22:51,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:22:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-01-14 00:22:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 00:22:51,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:51,634 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] [2019-01-14 00:22:51,637 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash -150926534, now seen corresponding path program 1 times [2019-01-14 00:22:51,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:22:52,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:52,432 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:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:52,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:52,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:52,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:52,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 00:22:52,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:52,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:52,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-14 00:22:52,784 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:22:52,788 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:22:52,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:52,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:52,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:22:52,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-14 00:22:53,837 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 25 treesize of output 21 [2019-01-14 00:22:53,840 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 21 treesize of output 13 [2019-01-14 00:22:53,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:53,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:53,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:53,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2019-01-14 00:22:54,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:54,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:54,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 72 [2019-01-14 00:22:54,165 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 72 treesize of output 53 [2019-01-14 00:22:54,166 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:54,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:22:54,212 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:22:54,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2019-01-14 00:22:54,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:54,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:22:54,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-14 00:22:54,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:173 [2019-01-14 00:22:54,749 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 41 [2019-01-14 00:22:54,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2019-01-14 00:22:54,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:54,782 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:22:54,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-01-14 00:22:54,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:54,881 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:22:54,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-14 00:22:54,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:54,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:54,903 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:22:54,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:18 [2019-01-14 00:22:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:22:54,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:54,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 49 [2019-01-14 00:22:54,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 00:22:54,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 00:22:54,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2300, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 00:22:54,989 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 50 states. [2019-01-14 00:22:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:58,115 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-01-14 00:22:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 00:22:58,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 58 [2019-01-14 00:22:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:58,117 INFO L225 Difference]: With dead ends: 77 [2019-01-14 00:22:58,118 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:22:58,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-14 00:22:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:22:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2019-01-14 00:22:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 00:22:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-14 00:22:58,124 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 58 [2019-01-14 00:22:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:58,124 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-14 00:22:58,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 00:22:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-14 00:22:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 00:22:58,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:58,129 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] [2019-01-14 00:22:58,130 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:22:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash -150926533, now seen corresponding path program 1 times [2019-01-14 00:22:58,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:58,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:58,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:58,382 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 00:22:58,550 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 00:22:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:22:59,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:59,348 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:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:59,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:59,464 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:59,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:59,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:59,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 00:22:59,830 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 19 treesize of output 14 [2019-01-14 00:22:59,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:59,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:59,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:25 [2019-01-14 00:22:59,955 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:59,958 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:59,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:59,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:59,984 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:59,987 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:59,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:59,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:00,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:00,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:43 [2019-01-14 00:23:00,357 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 53 treesize of output 54 [2019-01-14 00:23:00,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:00,364 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 41 treesize of output 37 [2019-01-14 00:23:00,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:00,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 47 treesize of output 39 [2019-01-14 00:23:00,400 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:23:00,424 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 39 treesize of output 35 [2019-01-14 00:23:00,425 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:00,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 00:23:00,477 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 31 treesize of output 27 [2019-01-14 00:23:00,482 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:00,483 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:00,487 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:00,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-01-14 00:23:00,493 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:00,494 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:00,502 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:00,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 00:23:00,526 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2019-01-14 00:23:01,361 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 102 [2019-01-14 00:23:01,367 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:01,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:01,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 100 [2019-01-14 00:23:01,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,465 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 0 case distinctions, treesize of input 88 treesize of output 75 [2019-01-14 00:23:01,467 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:23:01,547 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:01,645 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:23:01,769 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 108 treesize of output 110 [2019-01-14 00:23:01,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:01,802 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:01,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 100 [2019-01-14 00:23:01,808 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,900 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 99 treesize of output 92 [2019-01-14 00:23:01,901 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 69 [2019-01-14 00:23:01,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:01,959 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:01,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 74 [2019-01-14 00:23:01,965 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:01,983 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,009 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 82 treesize of output 84 [2019-01-14 00:23:02,042 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 77 treesize of output 70 [2019-01-14 00:23:02,042 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:02,114 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:02,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 82 [2019-01-14 00:23:02,131 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,163 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:02,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-14 00:23:02,230 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:124, output treesize:258 [2019-01-14 00:23:03,076 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 30 treesize of output 30 [2019-01-14 00:23:03,079 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:03,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-01-14 00:23:03,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:03,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:03,121 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 39 treesize of output 37 [2019-01-14 00:23:03,129 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:03,130 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 33 treesize of output 27 [2019-01-14 00:23:03,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:03,151 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:23:03,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:03,171 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:03,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2019-01-14 00:23:03,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:03,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:03,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:03,196 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:19 [2019-01-14 00:23:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:03,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2019-01-14 00:23:03,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 00:23:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 00:23:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3127, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 00:23:03,316 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 58 states. [2019-01-14 00:23:04,708 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-01-14 00:23:07,456 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-01-14 00:23:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:09,015 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-01-14 00:23:09,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 00:23:09,017 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-14 00:23:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:09,017 INFO L225 Difference]: With dead ends: 81 [2019-01-14 00:23:09,018 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 00:23:09,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=608, Invalid=7764, Unknown=0, NotChecked=0, Total=8372 [2019-01-14 00:23:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 00:23:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-01-14 00:23:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:23:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-14 00:23:09,023 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 58 [2019-01-14 00:23:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:09,024 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-14 00:23:09,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 00:23:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-14 00:23:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 00:23:09,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:09,025 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, 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:09,026 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:23:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash 751714331, now seen corresponding path program 1 times [2019-01-14 00:23:09,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:09,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:09,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:23:10,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:10,121 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:23:10,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:10,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:10,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:23:10,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:23:10,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,291 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:10,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-14 00:23:10,434 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 13 treesize of output 21 [2019-01-14 00:23:10,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-01-14 00:23:10,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,452 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:23:10,452 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,457 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:10,458 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-01-14 00:23:10,614 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 25 treesize of output 21 [2019-01-14 00:23:10,617 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 21 treesize of output 13 [2019-01-14 00:23:10,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2019-01-14 00:23:10,752 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 40 [2019-01-14 00:23:10,758 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 32 treesize of output 25 [2019-01-14 00:23:10,758 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:23:10,785 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:23:10,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:10,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-14 00:23:10,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:10,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:23:10,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:23:10,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:36, output treesize:49 [2019-01-14 00:23:11,017 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 28 treesize of output 28 [2019-01-14 00:23:11,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2019-01-14 00:23:11,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:11,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:11,043 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:11,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-01-14 00:23:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:23:11,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 40 [2019-01-14 00:23:11,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-14 00:23:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-14 00:23:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1531, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 00:23:11,074 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 41 states. [2019-01-14 00:23:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:13,220 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-01-14 00:23:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 00:23:13,222 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 62 [2019-01-14 00:23:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:13,223 INFO L225 Difference]: With dead ends: 79 [2019-01-14 00:23:13,224 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 00:23:13,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=341, Invalid=3691, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 00:23:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 00:23:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-01-14 00:23:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-14 00:23:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-14 00:23:13,229 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 62 [2019-01-14 00:23:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:13,230 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-14 00:23:13,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-14 00:23:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-14 00:23:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 00:23:13,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:13,233 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, 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:23:13,233 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:23:13,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash 935083808, now seen corresponding path program 2 times [2019-01-14 00:23:13,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:13,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:23:15,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:15,276 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:15,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:23:15,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:23:15,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:23:15,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:15,435 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:23:15,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:15,439 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:23:15,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 00:23:15,887 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:23:15,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:15,894 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:23:15,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 00:23:16,189 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:16,192 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:16,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:16,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:16,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:16,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:59 [2019-01-14 00:23:16,948 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 25 treesize of output 21 [2019-01-14 00:23:16,966 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 21 treesize of output 13 [2019-01-14 00:23:16,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:16,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:16,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:16,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2019-01-14 00:23:17,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2019-01-14 00:23:17,201 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 124 treesize of output 97 [2019-01-14 00:23:17,202 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:23:17,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:17,256 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 1 xjuncts. [2019-01-14 00:23:17,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:99 [2019-01-14 00:23:17,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:17,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,565 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 103 treesize of output 89 [2019-01-14 00:23:17,570 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:17,571 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 68 treesize of output 58 [2019-01-14 00:23:17,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:17,596 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 70 treesize of output 56 [2019-01-14 00:23:17,597 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:17,613 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:23:17,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:17,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:124, output treesize:69 [2019-01-14 00:23:17,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2019-01-14 00:23:17,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:17,927 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:17,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2019-01-14 00:23:17,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:17,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:17,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:17,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:45 [2019-01-14 00:23:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:23:18,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:18,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 57 [2019-01-14 00:23:18,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 00:23:18,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 00:23:18,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3127, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 00:23:18,093 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 58 states. [2019-01-14 00:23:19,543 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-14 00:23:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:25,230 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-14 00:23:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 00:23:25,234 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 71 [2019-01-14 00:23:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:25,235 INFO L225 Difference]: With dead ends: 76 [2019-01-14 00:23:25,235 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 00:23:25,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=254, Invalid=4168, Unknown=0, NotChecked=0, Total=4422 [2019-01-14 00:23:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 00:23:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-14 00:23:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 00:23:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-01-14 00:23:25,242 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 71 [2019-01-14 00:23:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:25,243 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-01-14 00:23:25,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 00:23:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-01-14 00:23:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 00:23:25,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:25,244 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:25,244 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-01-14 00:23:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1074038997, now seen corresponding path program 2 times [2019-01-14 00:23:25,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:25,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:25,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:23:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 00:23:25,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:25,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:23:25,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:23:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:23:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:23:25,389 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 6 states. [2019-01-14 00:23:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:25,423 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-01-14 00:23:25,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:23:25,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-01-14 00:23:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:25,424 INFO L225 Difference]: With dead ends: 50 [2019-01-14 00:23:25,424 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:23:25,425 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:23:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:23:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:23:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:23:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:23:25,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2019-01-14 00:23:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:25,426 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:23:25,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:23:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:23:25,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:23:25,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:23:25 BoogieIcfgContainer [2019-01-14 00:23:25,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:23:25,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:23:25,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:23:25,433 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:23:25,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:22:12" (3/4) ... [2019-01-14 00:23:25,438 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:23:25,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:23:25,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:23:25,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:23:25,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:23:25,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-14 00:23:25,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:23:25,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_first [2019-01-14 00:23:25,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 00:23:25,451 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-14 00:23:25,451 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 00:23:25,451 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:23:25,508 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:23:25,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:23:25,509 INFO L168 Benchmark]: Toolchain (without parser) took 74585.20 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 447.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -98.5 MB). Peak memory consumption was 348.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:23:25,511 INFO L168 Benchmark]: CDTParser took 0.32 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:23:25,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:23:25,511 INFO L168 Benchmark]: Boogie Preprocessor took 69.53 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:23:25,512 INFO L168 Benchmark]: RCFGBuilder took 835.61 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:23:25,512 INFO L168 Benchmark]: TraceAbstraction took 72868.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. [2019-01-14 00:23:25,512 INFO L168 Benchmark]: Witness Printer took 75.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:23:25,514 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.32 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 731.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.53 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 835.61 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72868.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. * Witness Printer took 75.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 594]: 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: 582]: 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]: 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: 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: 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: 583]: free always succeeds For all program executions holds that free 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: 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 - 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 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 76 locations, 20 error locations. SAFE Result, 72.8s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 46.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1001 SDtfs, 1311 SDslu, 5806 SDs, 0 SdLazy, 9682 SolverSat, 275 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1021 GetRequests, 484 SyntacticMatches, 20 SemanticMatches, 517 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4865 ImplicationChecksByTransitivity, 48.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 128 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1555 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1521 ConstructedInterpolants, 122 QuantifiedInterpolants, 837329 SizeOfPredicates, 135 NumberOfNonLiveVariables, 3036 ConjunctsInSsa, 484 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 318/543 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...