./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:20:11,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:20:11,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:20:11,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:20:11,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:20:11,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:20:11,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:20:11,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:20:11,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:20:11,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:20:11,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:20:11,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:20:11,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:20:11,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:20:11,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:20:11,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:20:11,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:20:11,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:20:11,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:20:11,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:20:11,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:20:11,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:20:11,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:20:11,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:20:11,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:20:11,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:20:11,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:20:11,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:20:11,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:20:11,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:20:11,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:20:11,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:20:11,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:20:11,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:20:11,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:20:11,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:20:11,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:20:11,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:20:11,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:20:11,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:20:11,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:20:11,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:20:11,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:20:11,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:20:11,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:20:11,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:20:11,243 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:20:11,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:20:11,244 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:20:11,244 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:20:11,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:20:11,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:20:11,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:20:11,249 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:20:11,249 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:20:11,249 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:20:11,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:20:11,250 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:20:11,250 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:20:11,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:20:11,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:20:11,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:20:11,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:20:11,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:11,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:20:11,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:20:11,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:20:11,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:20:11,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 [2019-11-15 21:20:11,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:20:11,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:20:11,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:20:11,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:20:11,300 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:20:11,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2019-11-15 21:20:11,357 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/29b9b087b/c3d2c8888e15472e9df446638f045d71/FLAGec3a10563 [2019-11-15 21:20:11,927 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:20:11,930 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2019-11-15 21:20:11,950 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/29b9b087b/c3d2c8888e15472e9df446638f045d71/FLAGec3a10563 [2019-11-15 21:20:12,215 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/29b9b087b/c3d2c8888e15472e9df446638f045d71 [2019-11-15 21:20:12,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:20:12,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:20:12,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:12,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:20:12,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:20:12,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1833de1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12, skipping insertion in model container [2019-11-15 21:20:12,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,249 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:20:12,302 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:20:12,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:12,734 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:20:12,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:12,838 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:20:12,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12 WrapperNode [2019-11-15 21:20:12,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:12,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:20:12,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:20:12,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:20:12,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... [2019-11-15 21:20:12,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:20:12,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:20:12,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:20:12,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:20:12,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:20:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:20:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:20:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:20:13,001 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:20:13,001 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:20:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-15 21:20:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_last [2019-11-15 21:20:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:20:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:20:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:20:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:20:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:20:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:20:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:20:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:20:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:20:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:20:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:20:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:20:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:20:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:20:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:20:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:20:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:20:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:20:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:20:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:20:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:20:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:20:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:20:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:20:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:20:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:20:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:20:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:20:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:20:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:20:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:20:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:20:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:20:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:20:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:20:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:20:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:20:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:20:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:20:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:20:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:20:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:20:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:20:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:20:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:20:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:20:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:20:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:20:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:20:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:20:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:20:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:20:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:20:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:20:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:20:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:20:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:20:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:20:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:20:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:20:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:20:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:20:13,025 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:20:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:20:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:20:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:20:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:20:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:20:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:20:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:20:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:20:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:20:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:20:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:20:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:20:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:20:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:20:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:20:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:20:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:20:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:20:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:20:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:20:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:20:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:20:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:20:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:20:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:20:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:20:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:20:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:20:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:20:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:20:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:20:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:20:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:20:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:20:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:20:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:20:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:20:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:20:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:20:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:20:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:20:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:20:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:20:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-15 21:20:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_last [2019-11-15 21:20:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:20:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:20:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:20:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:20:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:20:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:20:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:20:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:20:13,353 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:20:13,693 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:20:13,693 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 21:20:13,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:13 BoogieIcfgContainer [2019-11-15 21:20:13,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:20:13,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:20:13,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:20:13,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:20:13,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:20:12" (1/3) ... [2019-11-15 21:20:13,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8e116a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:13, skipping insertion in model container [2019-11-15 21:20:13,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:12" (2/3) ... [2019-11-15 21:20:13,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8e116a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:13, skipping insertion in model container [2019-11-15 21:20:13,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:13" (3/3) ... [2019-11-15 21:20:13,704 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2019-11-15 21:20:13,715 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:20:13,724 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-15 21:20:13,745 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-15 21:20:13,773 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:20:13,774 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:20:13,774 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:20:13,774 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:20:13,774 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:20:13,774 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:20:13,775 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:20:13,775 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:20:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-11-15 21:20:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:20:13,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:13,816 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:13,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:13,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219408, now seen corresponding path program 1 times [2019-11-15 21:20:13,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:13,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459967987] [2019-11-15 21:20:13,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:13,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:13,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:14,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459967987] [2019-11-15 21:20:14,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:14,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:14,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143316211] [2019-11-15 21:20:14,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:14,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:14,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:14,084 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2019-11-15 21:20:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:14,461 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2019-11-15 21:20:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:14,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 21:20:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:14,481 INFO L225 Difference]: With dead ends: 93 [2019-11-15 21:20:14,481 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 21:20:14,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 21:20:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2019-11-15 21:20:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-15 21:20:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-11-15 21:20:14,545 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 13 [2019-11-15 21:20:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:14,546 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-11-15 21:20:14,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-11-15 21:20:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:20:14,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:14,547 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:14,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219409, now seen corresponding path program 1 times [2019-11-15 21:20:14,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:14,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365665484] [2019-11-15 21:20:14,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:14,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:14,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:14,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365665484] [2019-11-15 21:20:14,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:14,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:14,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797593528] [2019-11-15 21:20:14,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:14,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:14,669 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 4 states. [2019-11-15 21:20:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:14,920 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-11-15 21:20:14,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:14,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 21:20:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:14,922 INFO L225 Difference]: With dead ends: 84 [2019-11-15 21:20:14,922 INFO L226 Difference]: Without dead ends: 84 [2019-11-15 21:20:14,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-15 21:20:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2019-11-15 21:20:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 21:20:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-11-15 21:20:14,938 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 13 [2019-11-15 21:20:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:14,939 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-11-15 21:20:14,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-11-15 21:20:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:20:14,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:14,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:14,942 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash -39903579, now seen corresponding path program 1 times [2019-11-15 21:20:14,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:14,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958063286] [2019-11-15 21:20:14,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:14,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:14,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:15,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958063286] [2019-11-15 21:20:15,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:15,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:20:15,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953204472] [2019-11-15 21:20:15,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:20:15,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:15,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:20:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:20:15,092 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 6 states. [2019-11-15 21:20:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:15,493 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-11-15 21:20:15,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:20:15,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 21:20:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:15,496 INFO L225 Difference]: With dead ends: 87 [2019-11-15 21:20:15,496 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 21:20:15,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 21:20:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2019-11-15 21:20:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 21:20:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-11-15 21:20:15,507 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2019-11-15 21:20:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:15,508 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-11-15 21:20:15,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:20:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-11-15 21:20:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 21:20:15,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:15,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:15,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 307504148, now seen corresponding path program 1 times [2019-11-15 21:20:15,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:15,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409606554] [2019-11-15 21:20:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:15,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:15,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:15,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409606554] [2019-11-15 21:20:15,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:15,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:20:15,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961208594] [2019-11-15 21:20:15,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:20:15,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:20:15,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:15,656 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 8 states. [2019-11-15 21:20:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:16,311 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-11-15 21:20:16,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:20:16,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-15 21:20:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:16,314 INFO L225 Difference]: With dead ends: 123 [2019-11-15 21:20:16,314 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 21:20:16,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:20:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 21:20:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2019-11-15 21:20:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 21:20:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-11-15 21:20:16,341 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 17 [2019-11-15 21:20:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:16,342 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-11-15 21:20:16,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:20:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-11-15 21:20:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 21:20:16,344 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:16,344 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:16,345 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash 307504149, now seen corresponding path program 1 times [2019-11-15 21:20:16,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:16,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375464410] [2019-11-15 21:20:16,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:16,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:16,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:16,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375464410] [2019-11-15 21:20:16,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:16,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:20:16,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647462640] [2019-11-15 21:20:16,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:20:16,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:16,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:20:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:20:16,486 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 7 states. [2019-11-15 21:20:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:16,933 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-11-15 21:20:16,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:20:16,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-15 21:20:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:16,934 INFO L225 Difference]: With dead ends: 89 [2019-11-15 21:20:16,934 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 21:20:16,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:20:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 21:20:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2019-11-15 21:20:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 21:20:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-11-15 21:20:16,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 17 [2019-11-15 21:20:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:16,943 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-11-15 21:20:16,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:20:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-11-15 21:20:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:20:16,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:16,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:16,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 123258323, now seen corresponding path program 1 times [2019-11-15 21:20:16,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:16,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268963725] [2019-11-15 21:20:16,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:16,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:16,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:17,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268963725] [2019-11-15 21:20:17,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:17,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:20:17,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783455902] [2019-11-15 21:20:17,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:20:17,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:20:17,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:17,059 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 8 states. [2019-11-15 21:20:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:17,420 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-11-15 21:20:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:20:17,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 21:20:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:17,422 INFO L225 Difference]: With dead ends: 79 [2019-11-15 21:20:17,422 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 21:20:17,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:20:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 21:20:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-11-15 21:20:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 21:20:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-11-15 21:20:17,429 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 19 [2019-11-15 21:20:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:17,430 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-11-15 21:20:17,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:20:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-11-15 21:20:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:20:17,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:17,431 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:17,431 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 123258324, now seen corresponding path program 1 times [2019-11-15 21:20:17,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:17,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592208422] [2019-11-15 21:20:17,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:17,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:17,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:17,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592208422] [2019-11-15 21:20:17,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:17,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:20:17,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824847308] [2019-11-15 21:20:17,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:20:17,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:17,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:20:17,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:17,576 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 8 states. [2019-11-15 21:20:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:17,933 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-11-15 21:20:17,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:20:17,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 21:20:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:17,934 INFO L225 Difference]: With dead ends: 78 [2019-11-15 21:20:17,934 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 21:20:17,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:20:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 21:20:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-15 21:20:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 21:20:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-11-15 21:20:17,942 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2019-11-15 21:20:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:17,942 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-11-15 21:20:17,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:20:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-11-15 21:20:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:20:17,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:17,944 INFO L380 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-11-15 21:20:17,944 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:17,945 INFO L82 PathProgramCache]: Analyzing trace with hash -616890411, now seen corresponding path program 1 times [2019-11-15 21:20:17,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:17,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767442323] [2019-11-15 21:20:17,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:17,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:17,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:18,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767442323] [2019-11-15 21:20:18,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797922230] [2019-11-15 21:20:18,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:18,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:20:18,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:18,368 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:18,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 21:20:18,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799499473] [2019-11-15 21:20:18,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:20:18,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:18,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:20:18,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:18,371 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 9 states. [2019-11-15 21:20:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:18,852 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-11-15 21:20:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:20:18,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 21:20:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:18,854 INFO L225 Difference]: With dead ends: 91 [2019-11-15 21:20:18,854 INFO L226 Difference]: Without dead ends: 88 [2019-11-15 21:20:18,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:20:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-15 21:20:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-11-15 21:20:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 21:20:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-11-15 21:20:18,862 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2019-11-15 21:20:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:18,862 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-11-15 21:20:18,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:20:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-11-15 21:20:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:20:18,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:18,865 INFO L380 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-11-15 21:20:19,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:19,079 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767796, now seen corresponding path program 2 times [2019-11-15 21:20:19,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:19,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656914289] [2019-11-15 21:20:19,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:19,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:19,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:20:20,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656914289] [2019-11-15 21:20:20,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271549118] [2019-11-15 21:20:20,045 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:20,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:20:20,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:20:20,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 21:20:20,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:20,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:20:20,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:20,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:20,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:20,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:20:20,281 INFO L375 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 5 treesize of output 3 [2019-11-15 21:20:20,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:20,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:20,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:20,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 21:20:20,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:20,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:20,432 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 21:20:20,433 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 21:20:20,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:20,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:20,449 INFO L496 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-11-15 21:20:20,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-11-15 21:20:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 21:20:20,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:20,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 19 [2019-11-15 21:20:20,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723401891] [2019-11-15 21:20:20,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 21:20:20,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 21:20:20,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:20:20,584 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 20 states. [2019-11-15 21:20:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:21,803 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2019-11-15 21:20:21,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:20:21,803 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-15 21:20:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:21,805 INFO L225 Difference]: With dead ends: 134 [2019-11-15 21:20:21,805 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 21:20:21,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2019-11-15 21:20:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 21:20:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 97. [2019-11-15 21:20:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 21:20:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-15 21:20:21,814 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 43 [2019-11-15 21:20:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:21,814 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-15 21:20:21,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 21:20:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-15 21:20:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:20:21,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:21,816 INFO L380 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-11-15 21:20:22,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:22,026 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767797, now seen corresponding path program 1 times [2019-11-15 21:20:22,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:22,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796187201] [2019-11-15 21:20:22,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:22,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:22,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:20:22,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796187201] [2019-11-15 21:20:22,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070855943] [2019-11-15 21:20:22,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:22,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 21:20:22,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:22,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:20:22,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:22,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:22,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:22,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:20:22,798 INFO L375 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 5 treesize of output 3 [2019-11-15 21:20:22,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:22,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:22,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:22,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 21:20:23,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:23,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:23,044 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 21:20:23,045 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 21:20:23,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:23,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:23,057 INFO L496 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-11-15 21:20:23,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-11-15 21:20:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:20:23,154 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:23,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-15 21:20:23,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705583128] [2019-11-15 21:20:23,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 21:20:23,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:20:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:20:23,156 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 21 states. [2019-11-15 21:20:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:24,867 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-11-15 21:20:24,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:20:24,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2019-11-15 21:20:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:24,870 INFO L225 Difference]: With dead ends: 142 [2019-11-15 21:20:24,870 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 21:20:24,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:20:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 21:20:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2019-11-15 21:20:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 21:20:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-11-15 21:20:24,882 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 43 [2019-11-15 21:20:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:24,883 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-11-15 21:20:24,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 21:20:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-11-15 21:20:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:20:24,884 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:24,885 INFO L380 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-11-15 21:20:25,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:25,098 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030653, now seen corresponding path program 1 times [2019-11-15 21:20:25,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:25,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315970134] [2019-11-15 21:20:25,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:25,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:25,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:20:25,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315970134] [2019-11-15 21:20:25,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:25,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:20:25,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256867704] [2019-11-15 21:20:25,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:20:25,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:20:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:20:25,434 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 15 states. [2019-11-15 21:20:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:26,381 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2019-11-15 21:20:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:20:26,382 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2019-11-15 21:20:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:26,383 INFO L225 Difference]: With dead ends: 165 [2019-11-15 21:20:26,384 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 21:20:26,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:20:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 21:20:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 127. [2019-11-15 21:20:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 21:20:26,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2019-11-15 21:20:26,391 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 44 [2019-11-15 21:20:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:26,391 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2019-11-15 21:20:26,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:20:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2019-11-15 21:20:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:20:26,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:26,393 INFO L380 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-11-15 21:20:26,394 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:26,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:26,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030654, now seen corresponding path program 1 times [2019-11-15 21:20:26,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:26,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32256682] [2019-11-15 21:20:26,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:26,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:26,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:20:26,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32256682] [2019-11-15 21:20:26,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:26,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 21:20:26,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055463416] [2019-11-15 21:20:26,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:20:26,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:26,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:20:26,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:20:26,747 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand 16 states. [2019-11-15 21:20:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:27,593 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2019-11-15 21:20:27,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:20:27,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-11-15 21:20:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:27,595 INFO L225 Difference]: With dead ends: 168 [2019-11-15 21:20:27,595 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 21:20:27,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:20:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 21:20:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 127. [2019-11-15 21:20:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 21:20:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-11-15 21:20:27,603 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 44 [2019-11-15 21:20:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:27,604 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-11-15 21:20:27,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:20:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-11-15 21:20:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:20:27,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:27,606 INFO L380 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-11-15 21:20:27,606 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash 565846907, now seen corresponding path program 1 times [2019-11-15 21:20:27,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:27,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872145272] [2019-11-15 21:20:27,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:27,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:27,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:20:27,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872145272] [2019-11-15 21:20:27,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:27,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:20:27,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123556429] [2019-11-15 21:20:27,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:20:27,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:20:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:20:27,893 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 15 states. [2019-11-15 21:20:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:28,886 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2019-11-15 21:20:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:20:28,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-11-15 21:20:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:28,889 INFO L225 Difference]: With dead ends: 126 [2019-11-15 21:20:28,889 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 21:20:28,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-11-15 21:20:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 21:20:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-11-15 21:20:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:20:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-11-15 21:20:28,896 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 47 [2019-11-15 21:20:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:28,897 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-11-15 21:20:28,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:20:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-11-15 21:20:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:20:28,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:28,899 INFO L380 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-11-15 21:20:28,900 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 361816003, now seen corresponding path program 1 times [2019-11-15 21:20:28,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:28,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915308650] [2019-11-15 21:20:28,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:28,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:28,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:20:29,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915308650] [2019-11-15 21:20:29,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:29,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:20:29,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462282945] [2019-11-15 21:20:29,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:20:29,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:29,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:20:29,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:29,012 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 8 states. [2019-11-15 21:20:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:29,424 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2019-11-15 21:20:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:20:29,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-15 21:20:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:29,427 INFO L225 Difference]: With dead ends: 127 [2019-11-15 21:20:29,427 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 21:20:29,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:20:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 21:20:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-11-15 21:20:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:20:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-11-15 21:20:29,434 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 48 [2019-11-15 21:20:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:29,434 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-11-15 21:20:29,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:20:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-11-15 21:20:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:20:29,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:29,436 INFO L380 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-11-15 21:20:29,436 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash 361816004, now seen corresponding path program 1 times [2019-11-15 21:20:29,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:29,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789495574] [2019-11-15 21:20:29,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:29,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:29,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:20:29,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789495574] [2019-11-15 21:20:29,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:29,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-15 21:20:29,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575865294] [2019-11-15 21:20:29,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:20:29,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:29,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:20:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:20:29,840 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 18 states. [2019-11-15 21:20:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:31,064 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2019-11-15 21:20:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 21:20:31,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-11-15 21:20:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:31,076 INFO L225 Difference]: With dead ends: 148 [2019-11-15 21:20:31,076 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 21:20:31,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:20:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 21:20:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2019-11-15 21:20:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:20:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2019-11-15 21:20:31,084 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 48 [2019-11-15 21:20:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:31,085 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2019-11-15 21:20:31,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:20:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2019-11-15 21:20:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:20:31,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:31,087 INFO L380 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-11-15 21:20:31,087 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:31,088 INFO L82 PathProgramCache]: Analyzing trace with hash 361385054, now seen corresponding path program 1 times [2019-11-15 21:20:31,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:31,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828019829] [2019-11-15 21:20:31,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:31,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:31,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:20:31,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828019829] [2019-11-15 21:20:31,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:31,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:20:31,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563799621] [2019-11-15 21:20:31,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:20:31,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:31,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:20:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:20:31,376 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 15 states. [2019-11-15 21:20:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:32,363 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2019-11-15 21:20:32,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:20:32,364 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-11-15 21:20:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:32,366 INFO L225 Difference]: With dead ends: 174 [2019-11-15 21:20:32,366 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 21:20:32,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:20:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 21:20:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 138. [2019-11-15 21:20:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 21:20:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2019-11-15 21:20:32,377 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 48 [2019-11-15 21:20:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:32,378 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2019-11-15 21:20:32,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:20:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2019-11-15 21:20:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 21:20:32,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:32,379 INFO L380 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-11-15 21:20:32,380 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:32,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1681965091, now seen corresponding path program 1 times [2019-11-15 21:20:32,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:32,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781001652] [2019-11-15 21:20:32,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:32,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:32,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:20:32,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781001652] [2019-11-15 21:20:32,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:32,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:20:32,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67233790] [2019-11-15 21:20:32,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:20:32,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:20:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:20:32,480 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand 7 states. [2019-11-15 21:20:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:32,871 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2019-11-15 21:20:32,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:20:32,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-11-15 21:20:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:32,873 INFO L225 Difference]: With dead ends: 137 [2019-11-15 21:20:32,873 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 21:20:32,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:20:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 21:20:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-15 21:20:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:20:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2019-11-15 21:20:32,880 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 49 [2019-11-15 21:20:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:32,880 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2019-11-15 21:20:32,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:20:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2019-11-15 21:20:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 21:20:32,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:32,882 INFO L380 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-11-15 21:20:32,883 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash -187169459, now seen corresponding path program 1 times [2019-11-15 21:20:32,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:32,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539432328] [2019-11-15 21:20:32,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:32,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:32,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:20:33,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539432328] [2019-11-15 21:20:33,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567124903] [2019-11-15 21:20:33,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-15 21:20:33,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:34,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:34,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:34,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:34,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:34,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:34,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:34,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:34,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2019-11-15 21:20:34,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:34,593 INFO L375 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 43 treesize of output 42 [2019-11-15 21:20:34,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:34,629 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.0 percent of original size [2019-11-15 21:20:34,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:34,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:36 [2019-11-15 21:20:34,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:34,989 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-15 21:20:34,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:35,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:35,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:35,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 17 [2019-11-15 21:20:35,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:35,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2019-11-15 21:20:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:35,027 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:35,048 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:20:35,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:4 [2019-11-15 21:20:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:20:35,057 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:35,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2019-11-15 21:20:35,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991210329] [2019-11-15 21:20:35,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 21:20:35,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 21:20:35,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1471, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:20:35,060 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand 40 states. [2019-11-15 21:20:36,610 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-15 21:20:37,175 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-11-15 21:20:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:38,087 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2019-11-15 21:20:38,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:20:38,087 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2019-11-15 21:20:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:38,089 INFO L225 Difference]: With dead ends: 161 [2019-11-15 21:20:38,089 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:20:38,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=309, Invalid=3473, Unknown=0, NotChecked=0, Total=3782 [2019-11-15 21:20:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:20:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2019-11-15 21:20:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 21:20:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2019-11-15 21:20:38,097 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 50 [2019-11-15 21:20:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:38,098 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2019-11-15 21:20:38,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 21:20:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2019-11-15 21:20:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:20:38,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:38,099 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:38,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:38,306 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash 518831993, now seen corresponding path program 1 times [2019-11-15 21:20:38,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:38,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83298221] [2019-11-15 21:20:38,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:38,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:38,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:20:38,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83298221] [2019-11-15 21:20:38,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073942215] [2019-11-15 21:20:38,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:39,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-15 21:20:39,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:39,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:39,327 INFO L375 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:20:39,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:39,344 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:20:39,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:39,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 21:20:39,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:39,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:39,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:39,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:39,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-15 21:20:39,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2019-11-15 21:20:39,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:39,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:39,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:39,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2019-11-15 21:20:40,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:40,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2019-11-15 21:20:40,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:40,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:40,044 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:40,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:40,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:40,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:40,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2019-11-15 21:20:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:40,077 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:40,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 39 [2019-11-15 21:20:40,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472505356] [2019-11-15 21:20:40,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 21:20:40,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:40,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 21:20:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1467, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:20:40,079 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand 40 states. [2019-11-15 21:20:41,904 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-15 21:20:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:43,098 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2019-11-15 21:20:43,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:20:43,098 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2019-11-15 21:20:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:43,100 INFO L225 Difference]: With dead ends: 164 [2019-11-15 21:20:43,100 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:20:43,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 21:20:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:20:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2019-11-15 21:20:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-15 21:20:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 176 transitions. [2019-11-15 21:20:43,108 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 176 transitions. Word has length 52 [2019-11-15 21:20:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:43,109 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 176 transitions. [2019-11-15 21:20:43,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 21:20:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 176 transitions. [2019-11-15 21:20:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:20:43,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:43,110 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:43,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:43,314 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:20:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 518831994, now seen corresponding path program 1 times [2019-11-15 21:20:43,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:43,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890243996] [2019-11-15 21:20:43,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:43,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:43,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:43,557 ERROR L253 erpolLogProxyWrapper]: Interpolant 2 not inductive [2019-11-15 21:20:43,563 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:863) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:385) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:332) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:20:43,569 INFO L168 Benchmark]: Toolchain (without parser) took 31350.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 469.8 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -445.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:43,570 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:20:43,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:43,571 INFO L168 Benchmark]: Boogie Preprocessor took 76.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:20:43,571 INFO L168 Benchmark]: RCFGBuilder took 777.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:43,571 INFO L168 Benchmark]: TraceAbstraction took 29872.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -348.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:20:43,573 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 777.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29872.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -348.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:20:45,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:20:45,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:20:45,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:20:45,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:20:45,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:20:45,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:20:45,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:20:45,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:20:45,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:20:45,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:20:45,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:20:45,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:20:45,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:20:45,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:20:45,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:20:45,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:20:45,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:20:45,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:20:45,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:20:45,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:20:45,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:20:46,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:20:46,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:20:46,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:20:46,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:20:46,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:20:46,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:20:46,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:20:46,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:20:46,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:20:46,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:20:46,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:20:46,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:20:46,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:20:46,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:20:46,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:20:46,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:20:46,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:20:46,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:20:46,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:20:46,014 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:20:46,028 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:20:46,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:20:46,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:20:46,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:20:46,030 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:20:46,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:20:46,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:20:46,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:20:46,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:20:46,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:20:46,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:20:46,032 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:20:46,032 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:20:46,032 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:20:46,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:20:46,033 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:20:46,033 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:20:46,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:20:46,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:20:46,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:20:46,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:20:46,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:20:46,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:20:46,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:46,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:20:46,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:20:46,035 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:20:46,035 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:20:46,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:20:46,036 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 [2019-11-15 21:20:46,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:20:46,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:20:46,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:20:46,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:20:46,082 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:20:46,083 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2019-11-15 21:20:46,144 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/47dd556e9/4078c3d853b64dc195cdc6f8da6ea5c2/FLAG026bdfd7c [2019-11-15 21:20:46,649 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:20:46,650 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2019-11-15 21:20:46,668 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/47dd556e9/4078c3d853b64dc195cdc6f8da6ea5c2/FLAG026bdfd7c [2019-11-15 21:20:47,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/data/47dd556e9/4078c3d853b64dc195cdc6f8da6ea5c2 [2019-11-15 21:20:47,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:20:47,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:20:47,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:47,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:20:47,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:20:47,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693a5fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47, skipping insertion in model container [2019-11-15 21:20:47,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,025 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:20:47,070 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:20:47,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:47,648 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:20:47,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:47,803 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:20:47,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47 WrapperNode [2019-11-15 21:20:47,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:47,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:20:47,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:20:47,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:20:47,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... [2019-11-15 21:20:47,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:20:47,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:20:47,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:20:47,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:20:47,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:47,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:20:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:20:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:20:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:20:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:20:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:20:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-15 21:20:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_last [2019-11-15 21:20:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:20:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:20:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:20:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:20:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:20:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:20:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:20:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:20:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:20:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:20:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:20:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:20:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:20:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:20:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:20:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:20:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:20:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:20:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:20:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:20:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:20:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:20:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:20:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:20:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:20:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:20:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:20:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:20:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:20:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:20:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:20:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:20:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:20:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:20:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:20:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:20:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:20:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:20:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:20:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:20:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:20:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:20:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:20:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:20:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:20:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:20:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:20:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:20:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:20:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:20:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:20:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:20:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:20:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:20:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:20:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:20:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:20:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:20:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:20:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:20:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:20:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:20:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:20:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:20:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:20:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:20:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:20:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:20:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:20:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:20:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:20:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:20:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:20:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:20:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:20:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:20:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:20:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:20:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:20:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:20:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:20:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:20:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:20:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:20:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:20:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:20:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:20:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:20:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:20:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:20:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:20:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:20:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:20:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:20:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:20:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:20:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:20:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:20:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:20:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:20:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:20:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:20:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:20:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:20:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:20:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:20:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:20:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:20:48,022 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:20:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:20:48,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:20:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:20:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-15 21:20:48,024 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_last [2019-11-15 21:20:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:20:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:20:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:20:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:20:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:20:48,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:20:48,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:20:48,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:20:48,484 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:20:48,965 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:20:48,966 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 21:20:48,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:48 BoogieIcfgContainer [2019-11-15 21:20:48,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:20:48,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:20:48,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:20:48,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:20:48,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:20:47" (1/3) ... [2019-11-15 21:20:48,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12eb7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:48, skipping insertion in model container [2019-11-15 21:20:48,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:47" (2/3) ... [2019-11-15 21:20:48,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12eb7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:48, skipping insertion in model container [2019-11-15 21:20:48,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:48" (3/3) ... [2019-11-15 21:20:48,977 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2019-11-15 21:20:48,989 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:20:48,999 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-15 21:20:49,012 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-15 21:20:49,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:20:49,037 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:20:49,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:20:49,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:20:49,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:20:49,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:20:49,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:20:49,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:20:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-11-15 21:20:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:20:49,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:49,081 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:49,083 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:20:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:49,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219408, now seen corresponding path program 1 times [2019-11-15 21:20:49,104 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:20:49,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [568238930] [2019-11-15 21:20:49,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9afc028-deb9-4610-89a0-0cc885212ef0/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:20:49,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:20:49,344 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:20:49,350 INFO L168 Benchmark]: Toolchain (without parser) took 2342.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:49,351 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:20:49,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -208.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:49,352 INFO L168 Benchmark]: Boogie Preprocessor took 99.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:20:49,353 INFO L168 Benchmark]: RCFGBuilder took 1063.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:49,358 INFO L168 Benchmark]: TraceAbstraction took 378.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:49,367 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 796.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -208.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1063.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 378.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...