./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf89a9db9089e52f60762f5e253ea7c1b22972a3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 12:24:34,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 12:24:34,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 12:24:34,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 12:24:34,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 12:24:34,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 12:24:34,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 12:24:34,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 12:24:34,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 12:24:34,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 12:24:34,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 12:24:34,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 12:24:34,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 12:24:34,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 12:24:34,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 12:24:34,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 12:24:34,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 12:24:34,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 12:24:34,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 12:24:34,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 12:24:34,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 12:24:34,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 12:24:34,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 12:24:34,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 12:24:34,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 12:24:34,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 12:24:34,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 12:24:34,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 12:24:34,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 12:24:34,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 12:24:34,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 12:24:34,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 12:24:34,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 12:24:34,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 12:24:34,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 12:24:34,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 12:24:34,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 12:24:34,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 12:24:34,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 12:24:34,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 12:24:34,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 12:24:34,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 12:24:34,162 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 12:24:34,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 12:24:34,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 12:24:34,163 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 12:24:34,164 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 12:24:34,164 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 12:24:34,164 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 12:24:34,164 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 12:24:34,164 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 12:24:34,165 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 12:24:34,165 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 12:24:34,165 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 12:24:34,170 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 12:24:34,170 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 12:24:34,170 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 12:24:34,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 12:24:34,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 12:24:34,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 12:24:34,171 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 12:24:34,171 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 12:24:34,172 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 12:24:34,173 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 12:24:34,173 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 12:24:34,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 12:24:34,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 12:24:34,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:24:34,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 12:24:34,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 12:24:34,174 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 12:24:34,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 12:24:34,174 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 12:24:34,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 12:24:34,174 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan 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 -> Taipan 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 -> bf89a9db9089e52f60762f5e253ea7c1b22972a3 [2020-12-09 12:24:34,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 12:24:34,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 12:24:34,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 12:24:34,367 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 12:24:34,367 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 12:24:34,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2020-12-09 12:24:34,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/data/adbba0ed4/a0e6ba97e6594c7e8bcf7180244dd760/FLAG5b98d093d [2020-12-09 12:24:34,822 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 12:24:34,822 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2020-12-09 12:24:34,831 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/data/adbba0ed4/a0e6ba97e6594c7e8bcf7180244dd760/FLAG5b98d093d [2020-12-09 12:24:34,841 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/data/adbba0ed4/a0e6ba97e6594c7e8bcf7180244dd760 [2020-12-09 12:24:34,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 12:24:34,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 12:24:34,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 12:24:34,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 12:24:34,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 12:24:34,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:24:34" (1/1) ... [2020-12-09 12:24:34,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fb53d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:34, skipping insertion in model container [2020-12-09 12:24:34,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:24:34" (1/1) ... [2020-12-09 12:24:34,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 12:24:34,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 12:24:35,059 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2020-12-09 12:24:35,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:24:35,068 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 12:24:35,099 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2020-12-09 12:24:35,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:24:35,137 INFO L208 MainTranslator]: Completed translation [2020-12-09 12:24:35,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35 WrapperNode [2020-12-09 12:24:35,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 12:24:35,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 12:24:35,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 12:24:35,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 12:24:35,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 12:24:35,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 12:24:35,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 12:24:35,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 12:24:35,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... [2020-12-09 12:24:35,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 12:24:35,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 12:24:35,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 12:24:35,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 12:24:35,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/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 [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 12:24:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 12:24:35,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 12:24:35,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 12:24:35,653 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-09 12:24:35,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:35 BoogieIcfgContainer [2020-12-09 12:24:35,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 12:24:35,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 12:24:35,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 12:24:35,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 12:24:35,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:24:34" (1/3) ... [2020-12-09 12:24:35,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4297fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:24:35, skipping insertion in model container [2020-12-09 12:24:35,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:35" (2/3) ... [2020-12-09 12:24:35,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4297fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:24:35, skipping insertion in model container [2020-12-09 12:24:35,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:35" (3/3) ... [2020-12-09 12:24:35,663 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2020-12-09 12:24:35,675 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 12:24:35,679 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2020-12-09 12:24:35,689 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2020-12-09 12:24:35,705 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 12:24:35,705 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 12:24:35,705 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 12:24:35,705 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 12:24:35,705 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 12:24:35,706 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 12:24:35,706 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 12:24:35,706 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 12:24:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-12-09 12:24:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 12:24:35,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:35,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 12:24:35,722 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash 5461878, now seen corresponding path program 1 times [2020-12-09 12:24:35,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:35,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169000107] [2020-12-09 12:24:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:35,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169000107] [2020-12-09 12:24:35,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:35,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:24:35,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524840259] [2020-12-09 12:24:35,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:24:35,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:35,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:24:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:24:35,871 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2020-12-09 12:24:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:35,943 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2020-12-09 12:24:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:24:35,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 12:24:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:35,950 INFO L225 Difference]: With dead ends: 76 [2020-12-09 12:24:35,950 INFO L226 Difference]: Without dead ends: 73 [2020-12-09 12:24:35,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:24:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-09 12:24:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2020-12-09 12:24:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 12:24:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2020-12-09 12:24:35,984 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 4 [2020-12-09 12:24:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:35,984 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2020-12-09 12:24:35,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:24:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-12-09 12:24:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 12:24:35,985 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:35,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 12:24:35,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 12:24:35,986 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 5461879, now seen corresponding path program 1 times [2020-12-09 12:24:35,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:35,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639461172] [2020-12-09 12:24:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:36,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639461172] [2020-12-09 12:24:36,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:36,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:24:36,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818047221] [2020-12-09 12:24:36,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:24:36,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:36,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:24:36,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:24:36,033 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2020-12-09 12:24:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:36,074 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-12-09 12:24:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:24:36,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 12:24:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:36,076 INFO L225 Difference]: With dead ends: 71 [2020-12-09 12:24:36,076 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 12:24:36,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:24:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 12:24:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2020-12-09 12:24:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 12:24:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-12-09 12:24:36,080 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 4 [2020-12-09 12:24:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:36,080 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-12-09 12:24:36,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:24:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-12-09 12:24:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 12:24:36,081 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:36,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 12:24:36,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 12:24:36,081 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash 173939328, now seen corresponding path program 1 times [2020-12-09 12:24:36,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:36,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578722672] [2020-12-09 12:24:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:36,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578722672] [2020-12-09 12:24:36,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:36,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:24:36,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428912527] [2020-12-09 12:24:36,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:24:36,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:24:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:24:36,109 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2020-12-09 12:24:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:36,123 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-12-09 12:24:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:24:36,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 12:24:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:36,125 INFO L225 Difference]: With dead ends: 46 [2020-12-09 12:24:36,125 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 12:24:36,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:24:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 12:24:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2020-12-09 12:24:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 12:24:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-12-09 12:24:36,130 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 5 [2020-12-09 12:24:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:36,131 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-12-09 12:24:36,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:24:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-12-09 12:24:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 12:24:36,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:36,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 12:24:36,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 12:24:36,132 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:36,132 INFO L82 PathProgramCache]: Analyzing trace with hash 953901427, now seen corresponding path program 1 times [2020-12-09 12:24:36,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:36,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927563619] [2020-12-09 12:24:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:36,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927563619] [2020-12-09 12:24:36,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:36,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:24:36,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272263391] [2020-12-09 12:24:36,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:24:36,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:36,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:24:36,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:24:36,173 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 4 states. [2020-12-09 12:24:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:36,219 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-12-09 12:24:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:24:36,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 12:24:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:36,220 INFO L225 Difference]: With dead ends: 54 [2020-12-09 12:24:36,220 INFO L226 Difference]: Without dead ends: 54 [2020-12-09 12:24:36,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:24:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-09 12:24:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2020-12-09 12:24:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 12:24:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-12-09 12:24:36,223 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2020-12-09 12:24:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:36,224 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-12-09 12:24:36,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:24:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-12-09 12:24:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 12:24:36,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:36,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 12:24:36,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 12:24:36,224 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash 953901428, now seen corresponding path program 1 times [2020-12-09 12:24:36,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:36,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204721238] [2020-12-09 12:24:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:36,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204721238] [2020-12-09 12:24:36,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:36,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:24:36,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435426553] [2020-12-09 12:24:36,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:24:36,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:24:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:24:36,270 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 4 states. [2020-12-09 12:24:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:36,305 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-12-09 12:24:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:24:36,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 12:24:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:36,306 INFO L225 Difference]: With dead ends: 41 [2020-12-09 12:24:36,306 INFO L226 Difference]: Without dead ends: 41 [2020-12-09 12:24:36,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:24:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-09 12:24:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-12-09 12:24:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 12:24:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-12-09 12:24:36,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2020-12-09 12:24:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:36,311 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-12-09 12:24:36,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:24:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-12-09 12:24:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 12:24:36,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:36,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:36,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 12:24:36,312 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1211877575, now seen corresponding path program 1 times [2020-12-09 12:24:36,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:36,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161477869] [2020-12-09 12:24:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:36,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161477869] [2020-12-09 12:24:36,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012732357] [2020-12-09 12:24:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/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 [2020-12-09 12:24:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:36,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:24:36,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:24:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:36,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:24:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:36,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [48282425] [2020-12-09 12:24:36,484 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 12:24:36,484 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:24:36,487 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:24:36,491 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:24:36,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:24:36,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:38,018 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:24:38,242 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-12-09 12:24:38,423 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-09 12:24:38,589 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 12:24:38,787 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-12-09 12:24:39,042 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-12-09 12:24:39,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:24:39,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 11 [2020-12-09 12:24:39,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675444653] [2020-12-09 12:24:39,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:24:39,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:39,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:24:39,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:24:39,045 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 9 states. [2020-12-09 12:24:39,179 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-12-09 12:24:39,489 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-12-09 12:24:39,642 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-12-09 12:24:39,785 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2020-12-09 12:24:39,993 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2020-12-09 12:24:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:40,073 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-12-09 12:24:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:24:40,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2020-12-09 12:24:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:40,074 INFO L225 Difference]: With dead ends: 51 [2020-12-09 12:24:40,074 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 12:24:40,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-12-09 12:24:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 12:24:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2020-12-09 12:24:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 12:24:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-12-09 12:24:40,077 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2020-12-09 12:24:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:40,077 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-12-09 12:24:40,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:24:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-12-09 12:24:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 12:24:40,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:40,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:40,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-09 12:24:40,280 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1211880868, now seen corresponding path program 1 times [2020-12-09 12:24:40,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:40,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577313744] [2020-12-09 12:24:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:40,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577313744] [2020-12-09 12:24:40,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613963662] [2020-12-09 12:24:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/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 [2020-12-09 12:24:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:40,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:24:40,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:24:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:40,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:24:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:40,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328938695] [2020-12-09 12:24:40,394 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 12:24:40,394 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:24:40,394 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:24:40,394 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:24:40,395 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:24:40,476 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:41,549 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:24:41,697 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2020-12-09 12:24:42,009 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-09 12:24:42,151 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 12:24:42,346 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-12-09 12:24:42,605 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-12-09 12:24:42,638 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 12:24:42,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:24:42,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-12-09 12:24:42,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718349343] [2020-12-09 12:24:42,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:24:42,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:42,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:24:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:24:42,640 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2020-12-09 12:24:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:42,653 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-12-09 12:24:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:24:42,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 12:24:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:42,654 INFO L225 Difference]: With dead ends: 45 [2020-12-09 12:24:42,654 INFO L226 Difference]: Without dead ends: 45 [2020-12-09 12:24:42,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:24:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-09 12:24:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-09 12:24:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 12:24:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2020-12-09 12:24:42,657 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2020-12-09 12:24:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:42,657 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2020-12-09 12:24:42,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:24:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-12-09 12:24:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 12:24:42,658 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:42,658 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 12:24:42,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2020-12-09 12:24:42,860 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2105547075, now seen corresponding path program 2 times [2020-12-09 12:24:42,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:42,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794727539] [2020-12-09 12:24:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 12:24:42,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794727539] [2020-12-09 12:24:42,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:42,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:24:42,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990541469] [2020-12-09 12:24:42,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:24:42,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:42,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:24:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:24:42,915 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2020-12-09 12:24:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:43,005 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2020-12-09 12:24:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:24:43,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-09 12:24:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:43,006 INFO L225 Difference]: With dead ends: 62 [2020-12-09 12:24:43,006 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 12:24:43,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:24:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 12:24:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2020-12-09 12:24:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 12:24:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2020-12-09 12:24:43,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 15 [2020-12-09 12:24:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:43,009 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2020-12-09 12:24:43,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:24:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2020-12-09 12:24:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 12:24:43,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:43,010 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 12:24:43,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2020-12-09 12:24:43,010 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2105547076, now seen corresponding path program 1 times [2020-12-09 12:24:43,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:43,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976221040] [2020-12-09 12:24:43,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:24:43,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976221040] [2020-12-09 12:24:43,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:43,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:24:43,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983505401] [2020-12-09 12:24:43,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:24:43,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:24:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:24:43,068 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 7 states. [2020-12-09 12:24:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:43,194 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2020-12-09 12:24:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:24:43,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-09 12:24:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:43,196 INFO L225 Difference]: With dead ends: 72 [2020-12-09 12:24:43,196 INFO L226 Difference]: Without dead ends: 72 [2020-12-09 12:24:43,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:24:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-09 12:24:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2020-12-09 12:24:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 12:24:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-12-09 12:24:43,200 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2020-12-09 12:24:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:43,200 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-12-09 12:24:43,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:24:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-12-09 12:24:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 12:24:43,201 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:43,201 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:43,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2020-12-09 12:24:43,201 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:43,202 INFO L82 PathProgramCache]: Analyzing trace with hash 501238048, now seen corresponding path program 1 times [2020-12-09 12:24:43,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:43,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012515525] [2020-12-09 12:24:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:43,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012515525] [2020-12-09 12:24:43,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399425997] [2020-12-09 12:24:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/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 [2020-12-09 12:24:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:43,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-09 12:24:43,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:24:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:43,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:24:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:43,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [299475796] [2020-12-09 12:24:43,541 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:24:43,541 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:24:43,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:24:43,541 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:24:43,541 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:24:43,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:44,811 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:24:45,205 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 90 [2020-12-09 12:24:45,423 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-12-09 12:24:45,594 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-09 12:24:45,774 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 12:24:46,003 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-12-09 12:24:46,608 WARN L197 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 92 [2020-12-09 12:24:46,797 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2020-12-09 12:24:47,247 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2020-12-09 12:24:47,248 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 12:24:47,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:24:47,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 18 [2020-12-09 12:24:47,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759753892] [2020-12-09 12:24:47,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 12:24:47,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 12:24:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2020-12-09 12:24:47,250 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 19 states. [2020-12-09 12:24:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:47,581 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2020-12-09 12:24:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 12:24:47,582 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-12-09 12:24:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:47,583 INFO L225 Difference]: With dead ends: 76 [2020-12-09 12:24:47,583 INFO L226 Difference]: Without dead ends: 76 [2020-12-09 12:24:47,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2020-12-09 12:24:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-09 12:24:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-12-09 12:24:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 12:24:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2020-12-09 12:24:47,587 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 17 [2020-12-09 12:24:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:47,587 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2020-12-09 12:24:47,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 12:24:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2020-12-09 12:24:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 12:24:47,587 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:47,587 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:47,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2020-12-09 12:24:47,789 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:47,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash 501238049, now seen corresponding path program 1 times [2020-12-09 12:24:47,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:47,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139145885] [2020-12-09 12:24:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:47,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139145885] [2020-12-09 12:24:47,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181582147] [2020-12-09 12:24:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/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 [2020-12-09 12:24:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:47,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-09 12:24:47,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:24:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:48,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:24:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:24:48,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [314197517] [2020-12-09 12:24:48,509 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:24:48,509 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:24:48,509 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:24:48,509 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:24:48,510 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:24:48,585 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:49,589 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:24:50,063 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 103 [2020-12-09 12:24:50,319 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-12-09 12:24:50,513 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-09 12:24:50,718 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 12:24:50,984 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-12-09 12:24:51,906 WARN L197 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2020-12-09 12:24:52,129 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2020-12-09 12:24:52,651 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 98 [2020-12-09 12:24:52,652 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 12:24:52,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:24:52,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2020-12-09 12:24:52,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586318784] [2020-12-09 12:24:52,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-09 12:24:52,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:52,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-09 12:24:52,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 12:24:52,653 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 30 states. [2020-12-09 12:24:53,969 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2020-12-09 12:24:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:54,260 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2020-12-09 12:24:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 12:24:54,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 17 [2020-12-09 12:24:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:54,262 INFO L225 Difference]: With dead ends: 191 [2020-12-09 12:24:54,262 INFO L226 Difference]: Without dead ends: 191 [2020-12-09 12:24:54,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=506, Invalid=2686, Unknown=0, NotChecked=0, Total=3192 [2020-12-09 12:24:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-09 12:24:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 57. [2020-12-09 12:24:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 12:24:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2020-12-09 12:24:54,266 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 17 [2020-12-09 12:24:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:54,266 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2020-12-09 12:24:54,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-09 12:24:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2020-12-09 12:24:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 12:24:54,267 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:54,267 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 12:24:54,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:24:54,469 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 650357792, now seen corresponding path program 2 times [2020-12-09 12:24:54,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:54,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928013536] [2020-12-09 12:24:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 12:24:54,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928013536] [2020-12-09 12:24:54,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:54,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:24:54,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405412509] [2020-12-09 12:24:54,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:24:54,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:24:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:24:54,537 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 6 states. [2020-12-09 12:24:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:54,568 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-12-09 12:24:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:24:54,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-09 12:24:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:54,569 INFO L225 Difference]: With dead ends: 46 [2020-12-09 12:24:54,569 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 12:24:54,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:24:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 12:24:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-09 12:24:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 12:24:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-12-09 12:24:54,571 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2020-12-09 12:24:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:54,571 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-12-09 12:24:54,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:24:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-12-09 12:24:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 12:24:54,571 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:54,571 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:54,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2020-12-09 12:24:54,572 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:54,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 959599523, now seen corresponding path program 1 times [2020-12-09 12:24:54,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:54,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675851360] [2020-12-09 12:24:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 12:24:54,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675851360] [2020-12-09 12:24:54,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692501656] [2020-12-09 12:24:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/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 [2020-12-09 12:24:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:54,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 12:24:54,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:24:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:24:54,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:24:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:24:54,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2017021248] [2020-12-09 12:24:54,690 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 12:24:54,690 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:24:54,690 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:24:54,690 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:24:54,690 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:24:54,748 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:55,049 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:55,058 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:55,717 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:55,867 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:56,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:56,208 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:24:56,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:24:56,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2020-12-09 12:24:56,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120766535] [2020-12-09 12:24:56,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 12:24:56,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 12:24:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:24:56,211 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2020-12-09 12:24:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:56,470 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2020-12-09 12:24:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 12:24:56,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-09 12:24:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:56,471 INFO L225 Difference]: With dead ends: 140 [2020-12-09 12:24:56,471 INFO L226 Difference]: Without dead ends: 140 [2020-12-09 12:24:56,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2020-12-09 12:24:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-12-09 12:24:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 60. [2020-12-09 12:24:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 12:24:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2020-12-09 12:24:56,474 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 21 [2020-12-09 12:24:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:56,475 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2020-12-09 12:24:56,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 12:24:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2020-12-09 12:24:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 12:24:56,475 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:56,475 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2020-12-09 12:24:56,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:24:56,676 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash -423220582, now seen corresponding path program 1 times [2020-12-09 12:24:56,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:56,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401582537] [2020-12-09 12:24:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:24:56,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401582537] [2020-12-09 12:24:56,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449904082] [2020-12-09 12:24:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:24:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:56,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 12:24:56,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:24:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:24:56,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:24:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:24:56,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [987755297] [2020-12-09 12:24:56,811 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:24:56,811 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:24:56,812 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:24:56,812 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:24:56,812 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:24:56,884 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:57,430 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:57,439 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:57,503 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:24:58,204 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:24:58,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:24:58,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2020-12-09 12:24:58,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089205176] [2020-12-09 12:24:58,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:24:58,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:24:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:24:58,205 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand 9 states. [2020-12-09 12:24:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:58,246 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-12-09 12:24:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:24:58,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-09 12:24:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:58,247 INFO L225 Difference]: With dead ends: 62 [2020-12-09 12:24:58,247 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 12:24:58,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:24:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 12:24:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2020-12-09 12:24:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 12:24:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2020-12-09 12:24:58,249 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2020-12-09 12:24:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:58,249 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2020-12-09 12:24:58,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:24:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2020-12-09 12:24:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 12:24:58,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:58,250 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:58,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:24:58,451 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash 42933150, now seen corresponding path program 1 times [2020-12-09 12:24:58,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:58,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750598334] [2020-12-09 12:24:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:24:58,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750598334] [2020-12-09 12:24:58,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:58,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:24:58,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446200418] [2020-12-09 12:24:58,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:24:58,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:58,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:24:58,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:24:58,517 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand 5 states. [2020-12-09 12:24:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:58,547 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2020-12-09 12:24:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:24:58,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-09 12:24:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:58,548 INFO L225 Difference]: With dead ends: 61 [2020-12-09 12:24:58,548 INFO L226 Difference]: Without dead ends: 61 [2020-12-09 12:24:58,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:24:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-09 12:24:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2020-12-09 12:24:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 12:24:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2020-12-09 12:24:58,550 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 24 [2020-12-09 12:24:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:58,550 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2020-12-09 12:24:58,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:24:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2020-12-09 12:24:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 12:24:58,550 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:58,550 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:58,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2020-12-09 12:24:58,551 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash 42930880, now seen corresponding path program 1 times [2020-12-09 12:24:58,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:58,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193299276] [2020-12-09 12:24:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:24:58,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193299276] [2020-12-09 12:24:58,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:24:58,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:24:58,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678858644] [2020-12-09 12:24:58,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:24:58,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:24:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:24:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:24:58,607 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand 7 states. [2020-12-09 12:24:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:24:58,710 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2020-12-09 12:24:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:24:58,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-09 12:24:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:24:58,711 INFO L225 Difference]: With dead ends: 71 [2020-12-09 12:24:58,711 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 12:24:58,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:24:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 12:24:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2020-12-09 12:24:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 12:24:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2020-12-09 12:24:58,713 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 24 [2020-12-09 12:24:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:24:58,713 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2020-12-09 12:24:58,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:24:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2020-12-09 12:24:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 12:24:58,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:24:58,714 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:24:58,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2020-12-09 12:24:58,714 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:24:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:24:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1693038344, now seen corresponding path program 1 times [2020-12-09 12:24:58,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:24:58,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769806262] [2020-12-09 12:24:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:24:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:24:58,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769806262] [2020-12-09 12:24:58,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616058513] [2020-12-09 12:24:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:24:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:24:58,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 60 conjunts are in the unsatisfiable core [2020-12-09 12:24:58,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:24:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 12:24:59,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:25:04,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_2 Int) (ULTIMATE.start_sll_update_at_~head.offset Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_2)) c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4))) 1)) is different from false [2020-12-09 12:25:18,562 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 21 [2020-12-09 12:25:19,872 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 21 [2020-12-09 12:25:21,932 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2020-12-09 12:25:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2020-12-09 12:25:21,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [963909797] [2020-12-09 12:25:21,974 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 12:25:21,974 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:25:21,974 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:25:21,974 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:25:21,974 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:25:22,034 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:22,317 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:22,343 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:22,353 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:22,363 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:22,976 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:23,139 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:23,288 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:25:23,459 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:25:23,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:25:23,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15] total 38 [2020-12-09 12:25:23,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159191749] [2020-12-09 12:25:23,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-09 12:25:23,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:25:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-09 12:25:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1265, Unknown=12, NotChecked=72, Total=1482 [2020-12-09 12:25:23,461 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 39 states. [2020-12-09 12:25:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:25:24,462 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2020-12-09 12:25:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 12:25:24,462 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 26 [2020-12-09 12:25:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:25:24,463 INFO L225 Difference]: With dead ends: 107 [2020-12-09 12:25:24,463 INFO L226 Difference]: Without dead ends: 107 [2020-12-09 12:25:24,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=455, Invalid=2399, Unknown=12, NotChecked=104, Total=2970 [2020-12-09 12:25:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-12-09 12:25:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 61. [2020-12-09 12:25:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 12:25:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2020-12-09 12:25:24,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 26 [2020-12-09 12:25:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:25:24,466 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2020-12-09 12:25:24,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-09 12:25:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2020-12-09 12:25:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 12:25:24,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:25:24,467 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:25:24,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:25:24,669 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:25:24,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:25:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1693038343, now seen corresponding path program 1 times [2020-12-09 12:25:24,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:25:24,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604275852] [2020-12-09 12:25:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:25:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:25:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:25:24,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604275852] [2020-12-09 12:25:24,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379090028] [2020-12-09 12:25:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:25:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:25:25,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 71 conjunts are in the unsatisfiable core [2020-12-09 12:25:25,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:25:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:25:25,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:25:26,551 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_4 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_4) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (let ((.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_6) .cse0))))))) is different from false [2020-12-09 12:26:17,992 WARN L197 SmtUtils]: Spent 3.20 s on a formula simplification that was a NOOP. DAG size: 47 [2020-12-09 12:26:19,092 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_4 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_8)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_4) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_3 Int) (v_prenex_9 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_9) (<= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_7)) c_ULTIMATE.start_main_~s~0.base) v_prenex_9 v_DerPreprocessor_3) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))) (forall ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_10 Int) (v_prenex_9 Int)) (or (= c_ULTIMATE.start_sll_update_at_~head.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_10)) c_ULTIMATE.start_main_~s~0.base) v_prenex_9 v_DerPreprocessor_6) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_9)))) is different from false [2020-12-09 12:26:21,109 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_60 Int)) (let ((.cse1 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (<= 0 (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse1))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_60 v_DerPreprocessor_8))) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_4) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (< v_ULTIMATE.start_sll_update_at_~head.offset_60 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse1))))) (forall ((v_DerPreprocessor_7 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_60 Int) (v_DerPreprocessor_3 Int) (v_prenex_9 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (<= (select (store (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse3))) (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_60 v_DerPreprocessor_7))) c_ULTIMATE.start_main_~s~0.base) v_prenex_9 v_DerPreprocessor_3) (+ c_ULTIMATE.start_main_~s~0.offset 4)) v_ULTIMATE.start_sll_update_at_~head.offset_60) (< v_ULTIMATE.start_sll_update_at_~head.offset_60 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse3)) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_9)))) (forall ((v_DerPreprocessor_6 Int) (v_prenex_10 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_60 Int) (v_DerPreprocessor_10 Int)) (let ((.cse4 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_10) (< v_ULTIMATE.start_sll_update_at_~head.offset_60 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse4)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse4))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_ULTIMATE.start_sll_update_at_~head.offset_60 v_DerPreprocessor_10)) c_ULTIMATE.start_main_~s~0.base) v_prenex_10 v_DerPreprocessor_6) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse5)))))) is different from false [2020-12-09 12:26:22,588 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_60 Int)) (let ((.cse1 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (<= 0 (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse1))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_60 v_DerPreprocessor_8))) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_4) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (< v_ULTIMATE.start_sll_update_at_~head.offset_60 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse1))))) (forall ((v_prenex_11 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_3 Int) (v_prenex_9 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (<= (select (store (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse3))) (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) v_prenex_11 v_DerPreprocessor_7))) c_ULTIMATE.start_main_~s~0.base) v_prenex_9 v_DerPreprocessor_3) (+ c_ULTIMATE.start_main_~s~0.offset 4)) v_prenex_11) (< v_prenex_11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse3)) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_9)))) (forall ((v_prenex_12 Int) (v_DerPreprocessor_6 Int) (v_prenex_10 Int) (v_DerPreprocessor_10 Int)) (let ((.cse5 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_10) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse5))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) v_prenex_12 v_DerPreprocessor_10)) c_ULTIMATE.start_main_~s~0.base) v_prenex_10 v_DerPreprocessor_6) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse4)) (< v_prenex_12 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse5)))))) is different from false [2020-12-09 12:26:24,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_11 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_3 Int) (v_prenex_9 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (<= (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse1))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) v_prenex_11 v_DerPreprocessor_7))) c_ULTIMATE.start_main_~s~0.base) v_prenex_9 v_DerPreprocessor_3) .cse1) v_prenex_11) (< v_prenex_11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse1)) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_9)))) (forall ((v_prenex_12 Int) (v_DerPreprocessor_6 Int) (v_prenex_10 Int) (v_DerPreprocessor_10 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_prenex_12 v_DerPreprocessor_10)) c_ULTIMATE.start_main_~s~0.base) v_prenex_10 v_DerPreprocessor_6) .cse3) .cse2)) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_10) (< v_prenex_12 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse3))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_60 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (<= 0 (select (store (select (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse5))) (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) v_ULTIMATE.start_sll_update_at_~head.offset_60 v_DerPreprocessor_8))) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_4) .cse5)) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (< v_ULTIMATE.start_sll_update_at_~head.offset_60 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse5)))))) is different from false [2020-12-09 12:26:26,620 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_11 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_3 Int) (v_prenex_9 Int)) (let ((.cse0 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (or (< v_prenex_11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse0)) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_9) (<= (select (store (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse0))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) v_prenex_11 v_DerPreprocessor_7))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_9 v_DerPreprocessor_3) .cse0) v_prenex_11)))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_60 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (<= 0 (select (store (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse3))) (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_60 v_DerPreprocessor_8))) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_4) .cse3)) (< v_ULTIMATE.start_sll_update_at_~head.offset_60 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse3))))) (forall ((v_prenex_12 Int) (v_DerPreprocessor_6 Int) (v_prenex_10 Int) (v_DerPreprocessor_10 Int)) (let ((.cse4 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (or (< v_prenex_12 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse4)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (= .cse5 (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_prenex_12 v_DerPreprocessor_10)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_10 v_DerPreprocessor_6) .cse4))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_10))))) is different from false [2020-12-09 12:26:51,799 WARN L197 SmtUtils]: Spent 9.59 s on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-12-09 12:27:06,159 WARN L197 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 48 [2020-12-09 12:27:07,121 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 12:27:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-12-09 12:27:07,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1691875329] [2020-12-09 12:27:07,134 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 12:27:07,135 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:27:07,135 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:27:07,135 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:27:07,135 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:27:07,209 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:27:07,474 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:27:07,502 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:27:08,129 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:27:08,299 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:27:08,436 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:27:08,643 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:27:08,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:27:08,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 17] total 43 [2020-12-09 12:27:08,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43174330] [2020-12-09 12:27:08,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-12-09 12:27:08,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:27:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-12-09 12:27:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1235, Unknown=58, NotChecked=462, Total=1892 [2020-12-09 12:27:08,646 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 44 states. [2020-12-09 12:27:10,779 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2020-12-09 12:27:12,973 WARN L197 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2020-12-09 12:27:15,270 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 124 DAG size of output: 56 [2020-12-09 12:27:17,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) 4))) (and (= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= (select |c_#length| c_ULTIMATE.start_sll_update_at_~head.base) 8) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~new_head~0.base) 1) (= 8 (select |c_#length| c_ULTIMATE.start_sll_create_~new_head~0.base)) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (= 8 (select |c_#length| .cse0)) (= (select |c_#length| c_ULTIMATE.start_sll_create_~head~0.base) 8) (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (= c_ULTIMATE.start_sll_create_~new_head~0.offset 0) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_4 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_4) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_59 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_59) (let ((.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_3) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_59 v_DerPreprocessor_6) .cse1)))))) (not (= .cse0 c_ULTIMATE.start_sll_create_~head~0.base)) (= c_ULTIMATE.start_sll_update_at_~head.offset 0) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (not (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) 4)) (= c_ULTIMATE.start_main_~s~0.offset 0) (= 8 (select |c_#length| c_ULTIMATE.start_node_create_~temp~0.base)) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) 4) 0))) is different from false [2020-12-09 12:27:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:27:28,221 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2020-12-09 12:27:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 12:27:28,222 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 26 [2020-12-09 12:27:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:27:28,222 INFO L225 Difference]: With dead ends: 99 [2020-12-09 12:27:28,222 INFO L226 Difference]: Without dead ends: 99 [2020-12-09 12:27:28,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 120.0s TimeCoverageRelationStatistics Valid=417, Invalid=2303, Unknown=64, NotChecked=756, Total=3540 [2020-12-09 12:27:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-09 12:27:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 60. [2020-12-09 12:27:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 12:27:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2020-12-09 12:27:28,227 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 26 [2020-12-09 12:27:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:27:28,228 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2020-12-09 12:27:28,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-12-09 12:27:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-12-09 12:27:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 12:27:28,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:27:28,228 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:27:28,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable526 [2020-12-09 12:27:28,430 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:27:28,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:27:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash 782815731, now seen corresponding path program 1 times [2020-12-09 12:27:28,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:27:28,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056172696] [2020-12-09 12:27:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:27:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:27:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:27:28,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056172696] [2020-12-09 12:27:28,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128363192] [2020-12-09 12:27:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:27:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:27:28,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 85 conjunts are in the unsatisfiable core [2020-12-09 12:27:28,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:27:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:27:29,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:27:54,268 WARN L197 SmtUtils]: Spent 8.04 s on a formula simplification that was a NOOP. DAG size: 53 [2020-12-09 12:27:56,281 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_11 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_19 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ (let ((.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_19)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_14) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_11) .cse0))) 1)))) (forall ((v_DerPreprocessor_13 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_DerPreprocessor_12 Int) (ULTIMATE.start_sll_update_at_~data Int)) (or (<= (+ (let ((.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 ULTIMATE.start_sll_update_at_~data)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_13) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_12) .cse1))) 1) (* 2 c_ULTIMATE.start_main_~len~0)) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69)))) is different from false [2020-12-09 12:27:56,804 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2020-12-09 12:27:57,026 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-12-09 12:27:59,050 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (and (forall ((v_prenex_25 Int) (v_prenex_24 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.base)) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_17)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_11) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset)) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ c_ULTIMATE.start_sll_update_at_~data 1)) (or (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_15 Int)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_14) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_22) (+ c_ULTIMATE.start_main_~s~0.offset 4)) v_ULTIMATE.start_sll_update_at_~head.offset_69))))))) (forall ((v_prenex_21 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (and (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_13) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (<= (+ c_ULTIMATE.start_sll_update_at_~data 1) (* 2 c_ULTIMATE.start_main_~len~0)) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_18)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_12) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset)) (or (forall ((v_prenex_26 Int) (v_prenex_29 Int)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) (+ c_ULTIMATE.start_main_~s~0.offset 4)) v_prenex_21)))))))) is different from false [2020-12-09 12:28:01,071 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse1 (+ c_ULTIMATE.start_sll_update_at_~data 1))) (and (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) .cse0))) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) .cse0) v_prenex_21))))) (forall ((v_DerPreprocessor_11 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_DerPreprocessor_17 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_17)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_11) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_21 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_18)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_12) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))) (<= .cse1 .cse2) (<= .cse2 .cse1) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.base))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_21 Int)) (or (= c_ULTIMATE.start_sll_update_at_~head.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_13) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21))) (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_22) .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_69)) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_14) .cse3)))))))) is different from false [2020-12-09 12:28:03,095 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse12 (+ c_ULTIMATE.start_sll_update_at_~data 1))) (and (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse3)) (.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) .cse2))) (not (= v_prenex_21 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) .cse2))))))) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_32 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_32) (let ((.cse6 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse6))) (= .cse4 (select (store (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse6))) (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse4 v_DerPreprocessor_18))) c_ULTIMATE.start_main_~s~0.base) v_prenex_32 v_DerPreprocessor_12) (+ c_ULTIMATE.start_main_~s~0.offset 4))))))) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int) (v_prenex_31 Int)) (or (let ((.cse9 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse9))) (= .cse7 (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse9))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse7 v_DerPreprocessor_17))) c_ULTIMATE.start_main_~s~0.base) v_prenex_31 v_DerPreprocessor_11) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_31))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_30 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_30) (let ((.cse11 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse11))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse11) v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_30 v_DerPreprocessor_13) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse10))))) (<= .cse12 .cse13) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (let ((.cse15 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse15))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse15) v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse14))))) (forall ((v_DerPreprocessor_14 Int) (v_prenex_23 Int) (v_prenex_33 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse19 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse19)) (.cse17 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse19)) (.cse18 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (not (= v_prenex_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse16 (store (select |c_#memory_$Pointer$.offset| .cse16) .cse17 v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_prenex_22) .cse18))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_33) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) .cse17 v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_DerPreprocessor_14) .cse18))))))) (<= .cse13 .cse12))) is different from false [2020-12-09 12:28:05,128 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_ULTIMATE.start_main_~i~0 1))) (and (forall ((v_DerPreprocessor_14 Int) (v_prenex_23 Int) (v_prenex_33 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse2))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_33) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_prenex_22) .cse2) v_prenex_33)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_DerPreprocessor_14) .cse2))))))) (<= c_ULTIMATE.start_main_~len~0 .cse3) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_32 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_32) (let ((.cse6 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse6))) (= .cse4 (select (store (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse6))) (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse4 v_DerPreprocessor_18))) c_ULTIMATE.start_main_~s~0.base) v_prenex_32 v_DerPreprocessor_12) .cse6)))))) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int) (v_prenex_31 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_31) (let ((.cse9 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse9))) (= .cse7 (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse9))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse7 v_DerPreprocessor_17))) c_ULTIMATE.start_main_~s~0.base) v_prenex_31 v_DerPreprocessor_11) .cse9)))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse12 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse12))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) .cse12) v_prenex_21)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) .cse12) c_ULTIMATE.start_main_~s~0.base)))))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_30 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_30) (let ((.cse14 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse14))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse14) v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_30 v_DerPreprocessor_13) .cse14) .cse13))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (let ((.cse16 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse16))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse15 (store (select |c_#memory_$Pointer$.base| .cse15) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse16) v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) .cse16) .cse15))))) (<= .cse3 c_ULTIMATE.start_main_~len~0))) is different from false [2020-12-09 12:28:07,150 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_30 Int)) (or (let ((.cse1 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse1) v_DerPreprocessor_16)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_30 v_DerPreprocessor_13) .cse1) .cse0))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_30))) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_32 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_32) (let ((.cse4 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (= (select (store (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 v_DerPreprocessor_18))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_32 v_DerPreprocessor_12) .cse4) .cse3))))) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int) (v_prenex_31 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_31) (let ((.cse7 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse7))) (= (select (store (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse7))) (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_DerPreprocessor_17))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_31 v_DerPreprocessor_11) .cse7) .cse6))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (let ((.cse9 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse9))) (= .cse8 (select (store (select (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse9) v_prenex_25)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) .cse9)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69))) (forall ((v_DerPreprocessor_14 Int) (v_prenex_23 Int) (v_prenex_33 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse12 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse12))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_DerPreprocessor_15)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_33 v_DerPreprocessor_14) .cse12) c_ULTIMATE.start_sll_create_~head~0.base)) (not (= v_prenex_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_prenex_23)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_33 v_prenex_22) .cse12))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_33))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse15 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse15)) (.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse15))) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_21) (not (= v_prenex_21 (select (store (select (store |c_#memory_$Pointer$.offset| .cse13 (store (select |c_#memory_$Pointer$.offset| .cse13) .cse14 v_prenex_28)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_21 v_prenex_27) .cse15))) (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) .cse14 v_prenex_29)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_21 v_prenex_26) .cse15)))))))) is different from false [2020-12-09 12:28:09,365 WARN L197 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 143 [2020-12-09 12:28:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2020-12-09 12:28:11,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1478060636] [2020-12-09 12:28:11,329 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 12:28:11,330 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:28:11,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:28:11,330 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:28:11,330 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:28:11,409 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:11,701 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:11,743 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:12,388 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:12,556 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:12,693 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:12,884 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:28:12,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:28:12,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 45 [2020-12-09 12:28:12,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910286705] [2020-12-09 12:28:12,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-12-09 12:28:12,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-12-09 12:28:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1377, Unknown=13, NotChecked=474, Total=1980 [2020-12-09 12:28:12,886 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 45 states. [2020-12-09 12:28:15,202 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_30 Int)) (or (let ((.cse1 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse1) v_DerPreprocessor_16)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_30 v_DerPreprocessor_13) .cse1) .cse0))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_30))) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_32 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_32) (let ((.cse4 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (= (select (store (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 v_DerPreprocessor_18))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_32 v_DerPreprocessor_12) .cse4) .cse3))))) (= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~new_head~0.base) 1) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) 4) c_ULTIMATE.start_sll_create_~head~0.base)) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int) (v_prenex_31 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_31) (let ((.cse7 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse7))) (= (select (store (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse7))) (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_DerPreprocessor_17))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_31 v_DerPreprocessor_11) .cse7) .cse6))))) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (let ((.cse9 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse9))) (= .cse8 (select (store (select (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse9) v_prenex_25)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) .cse9)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69))) (forall ((v_DerPreprocessor_14 Int) (v_prenex_23 Int) (v_prenex_33 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse12 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse12))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_DerPreprocessor_15)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_33 v_DerPreprocessor_14) .cse12) c_ULTIMATE.start_sll_create_~head~0.base)) (not (= v_prenex_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_prenex_23)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_33 v_prenex_22) .cse12))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_33))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse15 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse15)) (.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse15))) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_21) (not (= v_prenex_21 (select (store (select (store |c_#memory_$Pointer$.offset| .cse13 (store (select |c_#memory_$Pointer$.offset| .cse13) .cse14 v_prenex_28)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_21 v_prenex_27) .cse15))) (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) .cse14 v_prenex_29)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_21 v_prenex_26) .cse15)))))))) is different from false [2020-12-09 12:28:17,211 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_ULTIMATE.start_main_~i~0 1))) (and (forall ((v_DerPreprocessor_14 Int) (v_prenex_23 Int) (v_prenex_33 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse2))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_33) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_prenex_22) .cse2) v_prenex_33)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_DerPreprocessor_14) .cse2))))))) (not (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) 4))) (<= c_ULTIMATE.start_main_~len~0 .cse3) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_32 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_32) (let ((.cse6 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse6))) (= .cse4 (select (store (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse6))) (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse4 v_DerPreprocessor_18))) c_ULTIMATE.start_main_~s~0.base) v_prenex_32 v_DerPreprocessor_12) .cse6)))))) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int) (v_prenex_31 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_31) (let ((.cse9 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse9))) (= .cse7 (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse9))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse7 v_DerPreprocessor_17))) c_ULTIMATE.start_main_~s~0.base) v_prenex_31 v_DerPreprocessor_11) .cse9)))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse12 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse12))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) .cse12) v_prenex_21)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) .cse12) c_ULTIMATE.start_main_~s~0.base)))))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_30 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_30) (let ((.cse14 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse14))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse14) v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_30 v_DerPreprocessor_13) .cse14) .cse13))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (let ((.cse16 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse16))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse15 (store (select |c_#memory_$Pointer$.base| .cse15) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse16) v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) .cse16) .cse15))))) (= c_ULTIMATE.start_main_~s~0.offset 0) (<= .cse3 c_ULTIMATE.start_main_~len~0))) is different from false [2020-12-09 12:28:19,250 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse5 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse6 (+ c_ULTIMATE.start_sll_update_at_~data 1)) (.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base)) (.cse15 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse22))) (and (not (= c_ULTIMATE.start_main_~s~0.base (select .cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse4 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse4)) (.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) .cse3))) (not (= v_prenex_21 (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) .cse3))))))) (= .cse5 .cse6) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_32 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_32) (let ((.cse9 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse9))) (= .cse7 (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse9))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse7 v_DerPreprocessor_18))) c_ULTIMATE.start_main_~s~0.base) v_prenex_32 v_DerPreprocessor_12) (+ c_ULTIMATE.start_main_~s~0.offset 4))))))) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int) (v_prenex_31 Int)) (or (let ((.cse12 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse12))) (= .cse10 (select (store (select (let ((.cse11 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse12))) (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) .cse10 v_DerPreprocessor_17))) c_ULTIMATE.start_main_~s~0.base) v_prenex_31 v_DerPreprocessor_11) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_31))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_30 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_30) (let ((.cse14 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse14))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse14) v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_30 v_DerPreprocessor_13) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse13))))) (not (= c_ULTIMATE.start_main_~s~0.base .cse15)) (<= .cse6 .cse5) (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (let ((.cse17 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse17))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse17) v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse16))))) (<= .cse5 .cse6) (= c_ULTIMATE.start_main_~s~0.offset c_ULTIMATE.start_sll_update_at_~head.offset) (= (select .cse0 4) .cse15) (= c_ULTIMATE.start_sll_update_at_~head.offset 0) (= c_ULTIMATE.start_main_~s~0.offset 0) (forall ((v_DerPreprocessor_14 Int) (v_prenex_23 Int) (v_prenex_33 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse21 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse21)) (.cse19 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse21)) (.cse20 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (not (= v_prenex_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse18 (store (select |c_#memory_$Pointer$.offset| .cse18) .cse19 v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_prenex_22) .cse20))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_33) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) .cse19 v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_prenex_33 v_DerPreprocessor_14) .cse20))))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) 4) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse22))))) is different from false [2020-12-09 12:28:21,264 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse1 (+ c_ULTIMATE.start_sll_update_at_~data 1))) (and (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_21 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) .cse0))) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) .cse0) v_prenex_21))))) (forall ((v_DerPreprocessor_11 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_DerPreprocessor_17 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_17)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_11) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int) (v_prenex_21 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_18)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_12) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))) (<= .cse1 .cse2) (not (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) 4)) (= c_ULTIMATE.start_main_~s~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) 4) c_ULTIMATE.start_sll_update_at_~head.offset) (<= .cse2 .cse1) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.base))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int) (v_prenex_21 Int)) (or (= c_ULTIMATE.start_sll_update_at_~head.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_13) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21))) (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_22) .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_69)) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_14) .cse3)))))))) is different from false [2020-12-09 12:28:23,307 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse0 (+ c_ULTIMATE.start_sll_update_at_~data 1))) (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_69 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (and (forall ((v_prenex_25 Int) (v_prenex_24 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_25)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_24) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.base)) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_17 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_17)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_11) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset)) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ c_ULTIMATE.start_sll_update_at_~data 1)) (or (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_15 Int)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_15)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_14) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_23)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_22) (+ c_ULTIMATE.start_main_~s~0.offset 4)) v_ULTIMATE.start_sll_update_at_~head.offset_69))))))) (forall ((v_prenex_21 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_21) (and (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_16 Int)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_16)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_13) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (<= (+ c_ULTIMATE.start_sll_update_at_~data 1) (* 2 c_ULTIMATE.start_main_~len~0)) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_18 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_18)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_DerPreprocessor_12) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset)) (or (forall ((v_prenex_26 Int) (v_prenex_29 Int)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_29)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_26) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_28)) c_ULTIMATE.start_main_~s~0.base) v_prenex_21 v_prenex_27) (+ c_ULTIMATE.start_main_~s~0.offset 4)) v_prenex_21))))))) (<= .cse0 .cse1) (not (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) 4)) (= c_ULTIMATE.start_main_~s~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) 4) c_ULTIMATE.start_sll_update_at_~head.offset) (<= .cse1 .cse0))) is different from false [2020-12-09 12:28:25,315 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) 4))) (let ((.cse1 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse0 (+ (select (select |c_#memory_int| .cse2) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) 4)) 1))) (and (<= .cse0 .cse1) (not (= c_ULTIMATE.start_main_~s~0.base .cse2)) (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_11 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_prenex_19 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_prenex_19)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_14) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_11) .cse3))) 1)))) (= c_ULTIMATE.start_main_~s~0.offset 0) (forall ((v_DerPreprocessor_13 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_69 Int) (v_DerPreprocessor_12 Int) (ULTIMATE.start_sll_update_at_~data Int)) (or (<= (+ (let ((.cse4 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 ULTIMATE.start_sll_update_at_~data)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_13) .cse4)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_69 v_DerPreprocessor_12) .cse4))) 1) (* 2 c_ULTIMATE.start_main_~len~0)) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_69))) (<= .cse1 .cse0)))) is different from false [2020-12-09 12:28:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:26,079 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2020-12-09 12:28:26,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 12:28:26,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 28 [2020-12-09 12:28:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:26,080 INFO L225 Difference]: With dead ends: 72 [2020-12-09 12:28:26,080 INFO L226 Difference]: Without dead ends: 72 [2020-12-09 12:28:26,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 52.0s TimeCoverageRelationStatistics Valid=299, Invalid=2280, Unknown=19, NotChecked=1308, Total=3906 [2020-12-09 12:28:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-09 12:28:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2020-12-09 12:28:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 12:28:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2020-12-09 12:28:26,083 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 28 [2020-12-09 12:28:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:26,083 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2020-12-09 12:28:26,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-12-09 12:28:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2020-12-09 12:28:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 12:28:26,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:26,084 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:28:26,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable596 [2020-12-09 12:28:26,286 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 780635027, now seen corresponding path program 2 times [2020-12-09 12:28:26,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:26,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286150071] [2020-12-09 12:28:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:28:26,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286150071] [2020-12-09 12:28:26,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:28:26,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:28:26,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660121648] [2020-12-09 12:28:26,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:28:26,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:28:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:28:26,355 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 6 states. [2020-12-09 12:28:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:26,402 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-12-09 12:28:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:28:26,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-12-09 12:28:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:26,403 INFO L225 Difference]: With dead ends: 48 [2020-12-09 12:28:26,403 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 12:28:26,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:28:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 12:28:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-09 12:28:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 12:28:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-12-09 12:28:26,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 28 [2020-12-09 12:28:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:26,404 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-12-09 12:28:26,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:28:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-12-09 12:28:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 12:28:26,405 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:26,405 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:28:26,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2020-12-09 12:28:26,405 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:26,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1902674824, now seen corresponding path program 1 times [2020-12-09 12:28:26,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:26,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109756315] [2020-12-09 12:28:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:28:26,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109756315] [2020-12-09 12:28:26,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113359246] [2020-12-09 12:28:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:28:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:26,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 55 conjunts are in the unsatisfiable core [2020-12-09 12:28:26,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:28:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 12:28:27,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:28:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 12:28:27,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [409550045] [2020-12-09 12:28:27,828 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 12:28:27,828 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:28:27,828 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:28:27,828 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:28:27,828 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:28:27,909 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:28,189 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:28,197 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:28,874 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:29,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:29,177 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:29,376 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:28:29,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:28:29,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2020-12-09 12:28:29,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683223708] [2020-12-09 12:28:29,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-09 12:28:29,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-09 12:28:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 12:28:29,378 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 33 states. [2020-12-09 12:28:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:30,391 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2020-12-09 12:28:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 12:28:30,391 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2020-12-09 12:28:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:30,392 INFO L225 Difference]: With dead ends: 65 [2020-12-09 12:28:30,392 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 12:28:30,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=425, Invalid=1555, Unknown=0, NotChecked=0, Total=1980 [2020-12-09 12:28:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 12:28:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2020-12-09 12:28:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 12:28:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-12-09 12:28:30,394 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2020-12-09 12:28:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:30,394 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-12-09 12:28:30,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-09 12:28:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-12-09 12:28:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 12:28:30,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:30,395 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:28:30,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:28:30,596 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1184219171, now seen corresponding path program 1 times [2020-12-09 12:28:30,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:30,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230352389] [2020-12-09 12:28:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 12:28:30,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230352389] [2020-12-09 12:28:30,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:28:30,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 12:28:30,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407027370] [2020-12-09 12:28:30,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 12:28:30,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 12:28:30,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:28:30,687 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2020-12-09 12:28:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:30,804 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-12-09 12:28:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:28:30,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-12-09 12:28:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:30,805 INFO L225 Difference]: With dead ends: 59 [2020-12-09 12:28:30,806 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 12:28:30,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:28:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 12:28:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2020-12-09 12:28:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 12:28:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-12-09 12:28:30,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2020-12-09 12:28:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:30,807 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-12-09 12:28:30,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 12:28:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-12-09 12:28:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 12:28:30,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:30,808 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:28:30,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2020-12-09 12:28:30,808 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1184220614, now seen corresponding path program 1 times [2020-12-09 12:28:30,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:30,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369956001] [2020-12-09 12:28:30,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-09 12:28:30,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369956001] [2020-12-09 12:28:30,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112689109] [2020-12-09 12:28:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:28:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:30,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 12:28:30,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:28:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 12:28:30,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:28:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 12:28:30,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 12:28:30,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 7 [2020-12-09 12:28:30,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997079254] [2020-12-09 12:28:30,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:28:30,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:30,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:28:30,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:28:30,982 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2020-12-09 12:28:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:31,095 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-12-09 12:28:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 12:28:31,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-12-09 12:28:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:31,096 INFO L225 Difference]: With dead ends: 57 [2020-12-09 12:28:31,096 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 12:28:31,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:28:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 12:28:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2020-12-09 12:28:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 12:28:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2020-12-09 12:28:31,098 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 34 [2020-12-09 12:28:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:31,098 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2020-12-09 12:28:31,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:28:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2020-12-09 12:28:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 12:28:31,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:31,098 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:28:31,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable738 [2020-12-09 12:28:31,299 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:31,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1184220613, now seen corresponding path program 1 times [2020-12-09 12:28:31,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:31,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072232014] [2020-12-09 12:28:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 12:28:31,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072232014] [2020-12-09 12:28:31,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:28:31,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:28:31,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19228977] [2020-12-09 12:28:31,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:28:31,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:28:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:28:31,362 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 7 states. [2020-12-09 12:28:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:31,488 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-12-09 12:28:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:28:31,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-12-09 12:28:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:31,489 INFO L225 Difference]: With dead ends: 55 [2020-12-09 12:28:31,489 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 12:28:31,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:28:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 12:28:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2020-12-09 12:28:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 12:28:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-12-09 12:28:31,490 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 34 [2020-12-09 12:28:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:31,490 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-12-09 12:28:31,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:28:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-12-09 12:28:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 12:28:31,491 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:31,491 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:28:31,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2020-12-09 12:28:31,491 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:31,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1013807651, now seen corresponding path program 2 times [2020-12-09 12:28:31,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:31,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392652469] [2020-12-09 12:28:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 12:28:31,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392652469] [2020-12-09 12:28:31,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139920881] [2020-12-09 12:28:31,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:28:31,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 12:28:31,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:28:31,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 12:28:31,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:28:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 12:28:31,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:28:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 12:28:31,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224241563] [2020-12-09 12:28:31,663 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 12:28:31,663 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:28:31,664 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:28:31,664 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:28:31,664 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:28:31,735 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:32,020 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:32,065 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:32,765 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:32,922 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:33,080 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:33,272 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:28:33,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:28:33,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2020-12-09 12:28:33,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084422091] [2020-12-09 12:28:33,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:28:33,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:33,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:28:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:28:33,274 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 9 states. [2020-12-09 12:28:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:33,318 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2020-12-09 12:28:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:28:33,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-12-09 12:28:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:33,319 INFO L225 Difference]: With dead ends: 46 [2020-12-09 12:28:33,319 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 12:28:33,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:28:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 12:28:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-09 12:28:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 12:28:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-12-09 12:28:33,320 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 34 [2020-12-09 12:28:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:33,321 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-12-09 12:28:33,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:28:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-12-09 12:28:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 12:28:33,321 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:33,321 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:28:33,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable740 [2020-12-09 12:28:33,522 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash 130357274, now seen corresponding path program 1 times [2020-12-09 12:28:33,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:33,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477030872] [2020-12-09 12:28:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 12:28:33,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477030872] [2020-12-09 12:28:33,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:28:33,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:28:33,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193157292] [2020-12-09 12:28:33,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:28:33,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:28:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:28:33,606 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 7 states. [2020-12-09 12:28:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:33,704 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-12-09 12:28:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:28:33,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-12-09 12:28:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:33,705 INFO L225 Difference]: With dead ends: 47 [2020-12-09 12:28:33,705 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 12:28:33,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:28:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 12:28:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-12-09 12:28:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 12:28:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-12-09 12:28:33,707 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 36 [2020-12-09 12:28:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:33,707 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-12-09 12:28:33,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:28:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-12-09 12:28:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 12:28:33,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:33,708 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 12:28:33,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2020-12-09 12:28:33,708 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:33,709 INFO L82 PathProgramCache]: Analyzing trace with hash 823276142, now seen corresponding path program 1 times [2020-12-09 12:28:33,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:33,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981402228] [2020-12-09 12:28:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:28:34,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981402228] [2020-12-09 12:28:34,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354899468] [2020-12-09 12:28:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:28:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:34,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 82 conjunts are in the unsatisfiable core [2020-12-09 12:28:34,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:28:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:28:35,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:28:52,185 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 12:28:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:28:52,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1096628291] [2020-12-09 12:28:52,197 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2020-12-09 12:28:52,197 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:28:52,198 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:28:52,198 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:28:52,198 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:28:52,278 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:52,286 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:52,293 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:52,561 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:52,602 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:52,612 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:52,621 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:53,262 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:53,415 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:53,569 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:28:53,764 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:28:53,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:28:53,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 51 [2020-12-09 12:28:53,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356302167] [2020-12-09 12:28:53,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 51 states [2020-12-09 12:28:53,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:28:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2020-12-09 12:28:53,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2322, Unknown=14, NotChecked=0, Total=2550 [2020-12-09 12:28:53,766 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 51 states. [2020-12-09 12:28:54,949 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2020-12-09 12:28:56,560 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2020-12-09 12:28:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:28:57,917 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2020-12-09 12:28:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 12:28:57,918 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 39 [2020-12-09 12:28:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:28:57,919 INFO L225 Difference]: With dead ends: 105 [2020-12-09 12:28:57,919 INFO L226 Difference]: Without dead ends: 104 [2020-12-09 12:28:57,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=960, Invalid=6336, Unknown=14, NotChecked=0, Total=7310 [2020-12-09 12:28:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-09 12:28:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2020-12-09 12:28:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-09 12:28:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2020-12-09 12:28:57,922 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 39 [2020-12-09 12:28:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:28:57,922 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2020-12-09 12:28:57,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2020-12-09 12:28:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-12-09 12:28:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 12:28:57,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:28:57,923 INFO L422 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] [2020-12-09 12:28:58,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable811 [2020-12-09 12:28:58,125 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:28:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:28:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash 823274700, now seen corresponding path program 1 times [2020-12-09 12:28:58,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:28:58,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850397172] [2020-12-09 12:28:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:28:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:28:58,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850397172] [2020-12-09 12:28:58,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867901648] [2020-12-09 12:28:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:28:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:28:58,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 89 conjunts are in the unsatisfiable core [2020-12-09 12:28:58,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:28:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:28:59,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:29:02,353 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_24 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_111 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_111) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_24) 4) 4)))) (forall ((v_DerPreprocessor_23 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_111 Int) (v_DerPreprocessor_21 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_23) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_21) 4))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_111)))) is different from false [2020-12-09 12:30:08,825 WARN L197 SmtUtils]: Spent 8.03 s on a formula simplification that was a NOOP. DAG size: 48 [2020-12-09 12:30:47,663 WARN L197 SmtUtils]: Spent 10.03 s on a formula simplification that was a NOOP. DAG size: 52 [2020-12-09 12:30:49,685 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int) (v_prenex_56 Int) (v_prenex_57 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_21 Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) v_prenex_57 v_DerPreprocessor_25)) c_ULTIMATE.start_main_~s~0.base) v_prenex_56 v_DerPreprocessor_23) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_prenex_57 v_DerPreprocessor_27)) c_ULTIMATE.start_main_~s~0.base) v_prenex_56 v_DerPreprocessor_21) 4)))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_56))) (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_26 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_111 Int) (v_subst_2 Int)) (or (<= 0 (+ (select (store (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) v_subst_2 v_DerPreprocessor_26))) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_24) 4) 4)) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_111)))) is different from false [2020-12-09 12:30:51,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int) (v_prenex_56 Int) (v_prenex_57 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_21 Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) v_prenex_57 v_DerPreprocessor_25)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_56 v_DerPreprocessor_23) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_prenex_57 v_DerPreprocessor_27)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_56 v_DerPreprocessor_21) 4)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_56))) (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_26 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_111 Int) (v_subst_2 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_111) (<= 0 (+ (select (store (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4)))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) v_subst_2 v_DerPreprocessor_26))) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_24) 4) 4))))) is different from false [2020-12-09 12:30:51,809 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_24 Int) (v_prenex_58 (Array Int (Array Int Int))) (v_DerPreprocessor_26 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_111 Int) (v_subst_2 Int)) (or (<= 0 (+ (select (store (select (let ((.cse0 (store v_prenex_58 c_ULTIMATE.start_sll_create_~new_head~0.base (store (select v_prenex_58 c_ULTIMATE.start_sll_create_~new_head~0.base) (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4) c_ULTIMATE.start_sll_create_~head~0.offset)))) (store .cse0 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse0 c_ULTIMATE.start_sll_create_~head~0.base) v_subst_2 v_DerPreprocessor_26))) c_ULTIMATE.start_sll_create_~new_head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_24) 4) 4)) (< c_ULTIMATE.start_sll_create_~new_head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_111))) (forall ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int) (v_prenex_56 Int) (v_prenex_57 Int) (v_DerPreprocessor_27 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_DerPreprocessor_21 Int)) (or (< c_ULTIMATE.start_sll_create_~new_head~0.offset v_prenex_56) (let ((.cse2 (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4))) (<= (+ (select (store (select (let ((.cse1 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base) .cse2 c_ULTIMATE.start_sll_create_~head~0.offset)))) (store .cse1 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse1 c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_57 v_DerPreprocessor_25))) c_ULTIMATE.start_sll_create_~new_head~0.base) v_prenex_56 v_DerPreprocessor_23) 4) 8) (select |c_#length| (select (store (select (let ((.cse3 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) .cse2 c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse3 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse3 c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_57 v_DerPreprocessor_27))) c_ULTIMATE.start_sll_create_~new_head~0.base) v_prenex_56 v_DerPreprocessor_21) 4))))))) is different from false [2020-12-09 12:30:53,550 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 12:30:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 5 not checked. [2020-12-09 12:30:53,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496828944] [2020-12-09 12:30:53,579 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-12-09 12:30:53,579 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:30:53,579 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:30:53,579 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:30:53,579 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:30:53,670 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:53,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:53,992 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:54,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:54,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:54,759 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:54,941 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:55,092 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:30:55,324 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:30:55,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:30:55,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2020-12-09 12:30:55,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214844519] [2020-12-09 12:30:55,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-12-09 12:30:55,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:30:55,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-12-09 12:30:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1873, Unknown=52, NotChecked=364, Total=2450 [2020-12-09 12:30:55,326 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 50 states. [2020-12-09 12:31:02,706 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2020-12-09 12:31:05,113 WARN L197 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2020-12-09 12:31:05,538 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2020-12-09 12:31:05,947 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2020-12-09 12:31:06,236 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 45 [2020-12-09 12:31:08,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base)) (.cse2 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base)) (.cse7 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base)) (.cse9 (+ c_ULTIMATE.start_main_~s~0.offset 4)) (.cse10 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base)) (.cse8 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse4 (select .cse10 .cse8)) (.cse0 (select .cse7 .cse9)) (.cse1 (select .cse10 4)) (.cse5 (select .cse2 .cse9)) (.cse3 (select .cse6 .cse8))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~new_head~0.base) 1) (forall ((v_DerPreprocessor_24 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_111 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_111) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_24) 4) 4)))) (forall ((v_DerPreprocessor_23 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_111 Int) (v_DerPreprocessor_21 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_23) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_111 v_DerPreprocessor_21) 4))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_111))) (= 8 (select |c_#length| .cse1)) (= (select |c_#length| c_ULTIMATE.start_sll_create_~head~0.base) 8) (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (<= 0 c_ULTIMATE.start_main_~s~0.offset) (= c_ULTIMATE.start_sll_update_at_~head.offset 0) (<= c_ULTIMATE.start_main_~s~0.offset 0) (= 8 (select |c_#length| c_ULTIMATE.start_node_create_~temp~0.base)) (= (select .cse2 4) 0) (<= (+ .cse3 8) (select |c_#length| .cse4)) (= (select |c_#length| c_ULTIMATE.start_main_~s~0.base) 8) (= (select |c_#length| c_ULTIMATE.start_sll_update_at_~head.base) 8) (= 8 (select |c_#length| c_ULTIMATE.start_sll_create_~new_head~0.base)) (not (= .cse4 c_ULTIMATE.start_sll_create_~head~0.base)) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (<= .cse5 0) (<= (+ .cse5 8) (select |c_#length| .cse0)) (= c_ULTIMATE.start_sll_update_at_~head.base .cse0) (<= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= c_ULTIMATE.start_sll_create_~new_head~0.offset 0) (not (= .cse1 c_ULTIMATE.start_sll_create_~head~0.base)) (<= 0 .cse5) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= (select .cse6 4) 0) (not (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base)) (<= 0 c_ULTIMATE.start_sll_create_~head~0.offset) (= c_ULTIMATE.start_sll_update_at_~head.base (select .cse7 4)) (= c_ULTIMATE.start_main_~s~0.offset 0) (<= .cse3 0) (<= 0 .cse3)))) is different from false [2020-12-09 12:31:09,005 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2020-12-09 12:31:09,337 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 63 [2020-12-09 12:31:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:31:10,637 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-12-09 12:31:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 12:31:10,638 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 39 [2020-12-09 12:31:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:31:10,639 INFO L225 Difference]: With dead ends: 91 [2020-12-09 12:31:10,639 INFO L226 Difference]: Without dead ends: 91 [2020-12-09 12:31:10,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 125.3s TimeCoverageRelationStatistics Valid=537, Invalid=3460, Unknown=55, NotChecked=640, Total=4692 [2020-12-09 12:31:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-12-09 12:31:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2020-12-09 12:31:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 12:31:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-12-09 12:31:10,642 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 39 [2020-12-09 12:31:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:31:10,642 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-12-09 12:31:10,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-12-09 12:31:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-12-09 12:31:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 12:31:10,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:31:10,642 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:31:10,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:31:10,844 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:31:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:31:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash 893037163, now seen corresponding path program 1 times [2020-12-09 12:31:10,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:31:10,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524342512] [2020-12-09 12:31:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:31:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:31:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:31:11,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524342512] [2020-12-09 12:31:11,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710886228] [2020-12-09 12:31:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:31:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:31:11,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 76 conjunts are in the unsatisfiable core [2020-12-09 12:31:11,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:31:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 12:31:11,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:31:13,867 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_121 Int) (v_DerPreprocessor_29 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_121 v_DerPreprocessor_29) 4) 1) |c_#StackHeapBarrier|) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_121))) is different from false [2020-12-09 12:33:13,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_121 Int) (v_DerPreprocessor_29 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_123 Int) (v_DerPreprocessor_30 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_121) (<= (+ (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4)))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_123 v_DerPreprocessor_30))) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_121 v_DerPreprocessor_29) 4) 1) |c_#StackHeapBarrier|))) is different from false [2020-12-09 12:33:13,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_121 Int) (v_DerPreprocessor_29 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_update_at_~head.offset_123 Int) (v_DerPreprocessor_30 Int)) (or (<= (+ (select (store (select (let ((.cse0 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4) c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse0 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse0 c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_123 v_DerPreprocessor_30))) c_ULTIMATE.start_sll_create_~new_head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_121 v_DerPreprocessor_29) 4) 1) |c_#StackHeapBarrier|) (< c_ULTIMATE.start_sll_create_~new_head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_121))) is different from false [2020-12-09 12:33:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 4 not checked. [2020-12-09 12:33:15,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1240326299] [2020-12-09 12:33:15,629 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-12-09 12:33:15,629 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:33:15,629 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:33:15,630 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:33:15,630 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:33:15,783 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:16,385 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:16,401 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:16,416 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:16,433 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:17,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:17,840 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:18,044 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:33:18,433 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:33:18,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:33:18,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 40 [2020-12-09 12:33:18,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122108623] [2020-12-09 12:33:18,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-09 12:33:18,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:33:18,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-09 12:33:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1157, Unknown=117, NotChecked=222, Total=1640 [2020-12-09 12:33:18,435 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 41 states. [2020-12-09 12:33:25,633 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-12-09 12:33:28,050 WARN L197 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2020-12-09 12:33:32,758 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-09 12:33:37,355 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-12-09 12:33:39,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base))) (let ((.cse1 (select .cse0 4))) (and (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (= c_ULTIMATE.start_sll_update_at_~head.base (select .cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (not (= c_ULTIMATE.start_main_~s~0.base .cse1)) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~new_head~0.base) 1) (<= (+ c_ULTIMATE.start_sll_create_~new_head~0.base 1) |c_#StackHeapBarrier|) (<= (+ c_ULTIMATE.start_node_create_~temp~0.base 1) |c_#StackHeapBarrier|) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (<= (+ c_ULTIMATE.start_sll_create_~head~0.base 1) |c_#StackHeapBarrier|) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (= c_ULTIMATE.start_main_~s~0.offset 0) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_121 Int) (v_DerPreprocessor_29 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_121 v_DerPreprocessor_29) 4) 1) |c_#StackHeapBarrier|) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_121)))))) is different from false [2020-12-09 12:33:42,152 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-09 12:33:44,428 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-09 12:33:46,732 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-09 12:33:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:33:53,543 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2020-12-09 12:33:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 12:33:53,546 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2020-12-09 12:33:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:33:53,547 INFO L225 Difference]: With dead ends: 89 [2020-12-09 12:33:53,547 INFO L226 Difference]: Without dead ends: 89 [2020-12-09 12:33:53,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 156.0s TimeCoverageRelationStatistics Valid=462, Invalid=2393, Unknown=131, NotChecked=436, Total=3422 [2020-12-09 12:33:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-09 12:33:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2020-12-09 12:33:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-09 12:33:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2020-12-09 12:33:53,550 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 41 [2020-12-09 12:33:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:33:53,550 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2020-12-09 12:33:53,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-09 12:33:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2020-12-09 12:33:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 12:33:53,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:33:53,551 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:33:53,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable951 [2020-12-09 12:33:53,752 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:33:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:33:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1442852058, now seen corresponding path program 1 times [2020-12-09 12:33:53,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:33:53,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328523226] [2020-12-09 12:33:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:33:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:33:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:33:55,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328523226] [2020-12-09 12:33:55,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826945147] [2020-12-09 12:33:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:33:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:33:55,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 107 conjunts are in the unsatisfiable core [2020-12-09 12:33:55,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:33:58,990 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-09 12:33:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:33:59,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:34:16,269 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 31 [2020-12-09 12:34:18,287 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_33))) (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse0) (select .cse0 4))) 4) 0))) (forall ((v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_31 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4)) 4) 0)))) is different from false [2020-12-09 12:34:20,486 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_37)))) (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse0 c_ULTIMATE.start_main_~s~0.base .cse1) (select .cse1 4)))) 4) 0) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63))) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_DerPreprocessor_31 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_35)))) (store .cse2 c_ULTIMATE.start_main_~s~0.base (store (select .cse2 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4)) 4) 0)))) is different from false [2020-12-09 12:34:22,519 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse2 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse2))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse0 c_ULTIMATE.start_main_~s~0.base (store (select .cse0 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133)))) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_133) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63) (= (select (let ((.cse4 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse3))) (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_37))))) (let ((.cse5 (store (select .cse4 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse4 c_ULTIMATE.start_main_~s~0.base .cse5) (select .cse5 4)))) 4) 0))))) is different from false [2020-12-09 12:34:24,610 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse0 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse0) v_prenex_64) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63) (= (select (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse0))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse2 (store (select .cse1 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse1 c_ULTIMATE.start_main_~s~0.base .cse2) (select .cse2 4)))) 4) 0)))) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse6 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse6))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse4 c_ULTIMATE.start_main_~s~0.base (store (select .cse4 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse6) v_ULTIMATE.start_sll_update_at_~head.offset_133))))) is different from false [2020-12-09 12:34:26,635 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse2))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse0 c_ULTIMATE.start_main_~s~0.base (store (select .cse0 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133)))) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse3) v_prenex_64) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63) (= (select (let ((.cse4 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse3))) (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse5 (store (select .cse4 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse4 c_ULTIMATE.start_main_~s~0.base .cse5) (select .cse5 4)))) 4) 0))))) is different from false [2020-12-09 12:34:28,666 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse0 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_133) (= (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse0))) (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse1 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse1 c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0)))) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse3) v_prenex_64) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_63) (= (select (let ((.cse4 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse3))) (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse5 (store (select .cse4 c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse4 c_ULTIMATE.start_sll_create_~head~0.base .cse5) (select .cse5 4)))) 4) 0))))) is different from false [2020-12-09 12:34:30,692 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_64) (= (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4) c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse2 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse2 c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_sll_create_~new_head~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse0 c_ULTIMATE.start_sll_create_~new_head~0.base .cse1) (select .cse1 4)))) 4) 0) (< c_ULTIMATE.start_sll_create_~new_head~0.offset v_prenex_63))) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_133) (= (select (let ((.cse5 (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4))) (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base) .cse5 c_ULTIMATE.start_sll_create_~head~0.offset)))) (store .cse4 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse4 c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35))))) (store .cse3 c_ULTIMATE.start_sll_create_~new_head~0.base (store (select .cse3 c_ULTIMATE.start_sll_create_~new_head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (let ((.cse6 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) .cse5 c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse6 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse6 c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38))) c_ULTIMATE.start_sll_create_~new_head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< c_ULTIMATE.start_sll_create_~new_head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132)))) is different from false [2020-12-09 12:34:31,233 WARN L197 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-12-09 12:34:31,971 WARN L197 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-12-09 12:34:48,835 WARN L197 SmtUtils]: Spent 15.93 s on a formula simplification that was a NOOP. DAG size: 70 [2020-12-09 12:35:10,394 WARN L197 SmtUtils]: Spent 16.17 s on a formula simplification that was a NOOP. DAG size: 72 [2020-12-09 12:35:15,989 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 74 [2020-12-09 12:35:16,166 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-09 12:35:16,675 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-12-09 12:35:21,340 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-09 12:35:21,762 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-12-09 12:35:25,953 WARN L197 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-12-09 12:35:28,818 WARN L197 SmtUtils]: Spent 2.37 s on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 12:35:29,816 WARN L197 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2020-12-09 12:35:30,123 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-12-09 12:35:37,639 WARN L197 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-12-09 12:35:40,450 WARN L197 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 12:35:41,370 WARN L197 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2020-12-09 12:35:41,646 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-12-09 12:35:45,981 WARN L197 SmtUtils]: Spent 3.09 s on a formula simplification that was a NOOP. DAG size: 100 [2020-12-09 12:35:49,009 WARN L197 SmtUtils]: Spent 2.78 s on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 12:35:50,744 WARN L197 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 78 [2020-12-09 12:35:51,094 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-09 12:35:51,601 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_33 Int) (v_prenex_66 Int) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_69 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_ULTIMATE.start_node_create_~temp~0.offset_61 Int) (v_prenex_68 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int) (v_DerPreprocessor_41 Int)) (or (< v_ULTIMATE.start_node_create_~temp~0.offset_61 0) (< v_prenex_65 0) (< 0 v_prenex_65) (= (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store v_prenex_67 v_prenex_69 (store (select v_prenex_67 v_prenex_69) (+ v_ULTIMATE.start_node_create_~temp~0.offset_61 4) c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse3 v_prenex_66 (let ((.cse4 (+ v_prenex_65 4))) (store (store (store (select .cse3 v_prenex_66) .cse4 0) v_prenex_65 v_DerPreprocessor_41) .cse4 v_prenex_69)))))) (store .cse2 v_prenex_69 (store (select .cse2 v_prenex_69) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse1 (store (select .cse0 v_prenex_66) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse0 v_prenex_66 .cse1) (select .cse1 4)))) 4) 0) (< v_prenex_65 v_prenex_63) (< 0 (select (store v_prenex_68 v_prenex_69 1) v_prenex_66)) (< v_ULTIMATE.start_node_create_~temp~0.offset_61 v_prenex_64) (< 0 v_ULTIMATE.start_node_create_~temp~0.offset_61))) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_node_create_~temp~0.offset_61 Int) (v_ULTIMATE.start_node_create_~temp~0.offset_60 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_40 Int) (|#valid| (Array Int Int)) (|v_ULTIMATE.start_node_create_#t~malloc5.base_41| Int) (v_ULTIMATE.start_sll_create_~head~0.offset_96 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (|v_ULTIMATE.start_node_create_#t~malloc5.base_40| Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (< 0 v_ULTIMATE.start_node_create_~temp~0.offset_60) (= (select (let ((.cse8 (+ v_ULTIMATE.start_node_create_~temp~0.offset_60 4)) (.cse9 (+ v_ULTIMATE.start_node_create_~temp~0.offset_61 4))) (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_41| (store (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_41|) .cse9 c_ULTIMATE.start_sll_create_~head~0.offset)))) (store .cse7 |v_ULTIMATE.start_node_create_#t~malloc5.base_40| (store (store (store (select .cse7 |v_ULTIMATE.start_node_create_#t~malloc5.base_40|) .cse8 0) v_ULTIMATE.start_node_create_~temp~0.offset_60 v_DerPreprocessor_40) .cse8 v_ULTIMATE.start_sll_create_~head~0.offset_96))))) (store .cse6 |v_ULTIMATE.start_node_create_#t~malloc5.base_41| (store (select .cse6 |v_ULTIMATE.start_node_create_#t~malloc5.base_41|) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35))))) (store .cse5 |v_ULTIMATE.start_node_create_#t~malloc5.base_40| (store (select .cse5 |v_ULTIMATE.start_node_create_#t~malloc5.base_40|) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (let ((.cse10 (let ((.cse11 (store |#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_#t~malloc5.base_41| (store (select |#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_#t~malloc5.base_41|) .cse9 c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse11 |v_ULTIMATE.start_node_create_#t~malloc5.base_40| (store (store (store (select .cse11 |v_ULTIMATE.start_node_create_#t~malloc5.base_40|) .cse8 0) v_ULTIMATE.start_node_create_~temp~0.offset_60 v_DerPreprocessor_42) .cse8 |v_ULTIMATE.start_node_create_#t~malloc5.base_41|))))) (store .cse10 |v_ULTIMATE.start_node_create_#t~malloc5.base_41| (store (select .cse10 |v_ULTIMATE.start_node_create_#t~malloc5.base_41|) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38))) |v_ULTIMATE.start_node_create_#t~malloc5.base_40|) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< v_ULTIMATE.start_node_create_~temp~0.offset_61 0) (< v_ULTIMATE.start_node_create_~temp~0.offset_60 v_ULTIMATE.start_sll_update_at_~head.offset_132) (< v_ULTIMATE.start_node_create_~temp~0.offset_60 0) (< 0 (select (store |#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_41| 1) |v_ULTIMATE.start_node_create_#t~malloc5.base_40|)) (< v_ULTIMATE.start_node_create_~temp~0.offset_61 v_ULTIMATE.start_sll_create_~head~0.offset_96) (< v_ULTIMATE.start_sll_create_~head~0.offset_96 v_ULTIMATE.start_sll_update_at_~head.offset_133) (< 0 v_ULTIMATE.start_node_create_~temp~0.offset_61)))) is different from false [2020-12-09 12:35:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 11 not checked. [2020-12-09 12:35:51,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [823729217] [2020-12-09 12:35:51,647 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-12-09 12:35:51,647 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:35:51,647 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:35:51,647 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:35:51,648 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:35:51,798 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:35:52,250 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:35:52,329 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:35:53,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:35:53,678 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:35:53,876 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:35:54,229 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:35:54,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:35:54,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 56 [2020-12-09 12:35:54,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054433689] [2020-12-09 12:35:54,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 57 states [2020-12-09 12:35:54,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:35:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2020-12-09 12:35:54,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2174, Unknown=17, NotChecked=808, Total=3192 [2020-12-09 12:35:54,231 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 57 states. [2020-12-09 12:36:02,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base)) (.cse7 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base)) (.cse4 (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4)) (.cse5 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base)) (.cse8 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base)) (.cse6 (+ c_ULTIMATE.start_node_create_~temp~0.offset 4))) (and (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_64) (= (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4) c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse2 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse2 c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_sll_create_~new_head~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse0 c_ULTIMATE.start_sll_create_~new_head~0.base .cse1) (select .cse1 4)))) 4) 0) (< c_ULTIMATE.start_sll_create_~new_head~0.offset v_prenex_63))) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (= c_ULTIMATE.start_sll_create_~head~0.offset 0) (not (= c_ULTIMATE.start_sll_create_~head~0.base c_ULTIMATE.start_node_create_~temp~0.base)) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (= (select .cse3 .cse4) 0) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base (store .cse3 .cse4 c_ULTIMATE.start_sll_create_~head~0.offset)) c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (<= 0 c_ULTIMATE.start_sll_create_~new_head~0.offset) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store .cse5 .cse6 0)) c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (= (select .cse7 .cse4) 0) (not (= c_ULTIMATE.start_sll_create_~head~0.base c_ULTIMATE.start_sll_create_~new_head~0.base)) (<= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= (select .cse8 .cse6) 0) (= c_ULTIMATE.start_sll_create_~new_head~0.offset 0) (<= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= c_ULTIMATE.start_node_create_~temp~0.offset c_ULTIMATE.start_sll_create_~head~0.offset) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_133) (= (select (let ((.cse11 (+ c_ULTIMATE.start_sll_create_~new_head~0.offset 4))) (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~new_head~0.base) .cse11 c_ULTIMATE.start_sll_create_~head~0.offset)))) (store .cse10 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse10 c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35))))) (store .cse9 c_ULTIMATE.start_sll_create_~new_head~0.base (store (select .cse9 c_ULTIMATE.start_sll_create_~new_head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (let ((.cse12 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) .cse11 c_ULTIMATE.start_sll_create_~head~0.base)))) (store .cse12 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse12 c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38))) c_ULTIMATE.start_sll_create_~new_head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< c_ULTIMATE.start_sll_create_~new_head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132))) (= (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base (store .cse7 .cse4 c_ULTIMATE.start_sll_create_~head~0.base)) c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (= (select .cse5 .cse6) 0) (= (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store .cse8 .cse6 0)) c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (<= c_ULTIMATE.start_sll_create_~new_head~0.offset 0))) is different from false [2020-12-09 12:36:04,238 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) 4))) (and (= c_ULTIMATE.start_sll_create_~head~0.offset 0) (not (= .cse0 c_ULTIMATE.start_sll_create_~head~0.base)) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse1 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_133) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse1))) (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse2 c_ULTIMATE.start_sll_create_~head~0.base (store (select .cse2 c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0)))) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse4 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse4) v_prenex_64) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_63) (= (select (let ((.cse5 (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse6 (store (select .cse5 c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse5 c_ULTIMATE.start_sll_create_~head~0.base .cse6) (select .cse6 4)))) 4) 0)))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0))) is different from false [2020-12-09 12:36:06,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) 4))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (= c_ULTIMATE.start_main_~s~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) 4) 0) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse3))) (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse1 c_ULTIMATE.start_main_~s~0.base (store (select .cse1 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_133)))) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse4) v_prenex_64) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63) (= (select (let ((.cse5 (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse4))) (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse6 (store (select .cse5 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse5 c_ULTIMATE.start_main_~s~0.base .cse6) (select .cse6 4)))) 4) 0)))))) is different from false [2020-12-09 12:36:08,275 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4)) (.cse11 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base)) (.cse5 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select .cse11 .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse6))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse3))) (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse1 c_ULTIMATE.start_main_~s~0.base (store (select .cse1 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_133)))) (not (= c_ULTIMATE.start_main_~s~0.base .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0) (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base) (<= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse6) 0) (= 0 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (= c_ULTIMATE.start_main_~s~0.offset c_ULTIMATE.start_sll_update_at_~head.offset) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse7 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse7) v_prenex_64) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63) (= (select (let ((.cse8 (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse7))) (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) v_prenex_64 v_DerPreprocessor_37))))) (let ((.cse9 (store (select .cse8 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse8 c_ULTIMATE.start_main_~s~0.base .cse9) (select .cse9 4)))) 4) 0)))) (= (select .cse11 4) .cse4) (<= 0 c_ULTIMATE.start_main_~s~0.offset) (= c_ULTIMATE.start_sll_update_at_~head.offset 0) (<= c_ULTIMATE.start_main_~s~0.offset 0) (= c_ULTIMATE.start_main_~s~0.offset 0) (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)))) is different from false [2020-12-09 12:36:10,287 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4)) (.cse11 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base)) (.cse9 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select .cse11 .cse9)) (.cse4 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse10))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int) (v_DerPreprocessor_31 Int)) (let ((.cse3 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse3))) (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_35)))) (store .cse1 c_ULTIMATE.start_main_~s~0.base (store (select .cse1 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4))) 4) 0) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse3) v_ULTIMATE.start_sll_update_at_~head.offset_133)))) (not (= c_ULTIMATE.start_main_~s~0.base .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_133 Int)) (let ((.cse5 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (or (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse5) v_ULTIMATE.start_sll_update_at_~head.offset_133) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63) (= (select (let ((.cse6 (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse5))) (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) v_ULTIMATE.start_sll_update_at_~head.offset_133 v_DerPreprocessor_37))))) (let ((.cse7 (store (select .cse6 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse6 c_ULTIMATE.start_main_~s~0.base .cse7) (select .cse7 4)))) 4) 0)))) (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base) (<= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse9) 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse10) 0) (= 0 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (= c_ULTIMATE.start_main_~s~0.offset c_ULTIMATE.start_sll_update_at_~head.offset) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select .cse11 4) .cse4) (<= 0 c_ULTIMATE.start_main_~s~0.offset) (= c_ULTIMATE.start_sll_update_at_~head.offset 0) (<= c_ULTIMATE.start_main_~s~0.offset 0) (= c_ULTIMATE.start_main_~s~0.offset 0) (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)))) is different from false [2020-12-09 12:36:12,297 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base)) (.cse6 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse6)) (.cse0 (select .cse5 .cse6))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (<= .cse1 0) (= 0 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (<= c_ULTIMATE.start_sll_update_at_~head.offset .cse1) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) 4) 0) (= c_ULTIMATE.start_sll_update_at_~head.base .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_37 Int) (v_prenex_63 Int)) (or (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_37)))) (let ((.cse3 (store (select .cse2 c_ULTIMATE.start_main_~s~0.base) v_prenex_63 v_DerPreprocessor_33))) (select (store .cse2 c_ULTIMATE.start_main_~s~0.base .cse3) (select .cse3 4)))) 4) 0) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_63))) (<= 0 c_ULTIMATE.start_main_~s~0.offset) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) 4) 0) (= c_ULTIMATE.start_sll_update_at_~head.offset 0) (<= c_ULTIMATE.start_main_~s~0.offset 0) (not (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base)) (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_38 Int) (v_DerPreprocessor_31 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_35)))) (store .cse4 c_ULTIMATE.start_main_~s~0.base (store (select .cse4 c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31))) (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_38)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4)) 4) 0))) (= c_ULTIMATE.start_sll_update_at_~head.base (select .cse5 4)) (= c_ULTIMATE.start_main_~s~0.offset 0)))) is different from false [2020-12-09 12:36:14,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse1))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (<= 0 c_ULTIMATE.start_main_~s~0.offset) (<= c_ULTIMATE.start_main_~s~0.offset 0) (<= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse1) 0) (forall ((v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_33))) (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2) (select .cse2 4))) 4) 0))) (= 0 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (forall ((v_DerPreprocessor_34 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_132 Int) (v_DerPreprocessor_31 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_132) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_31)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_132 v_DerPreprocessor_34) 4)) 4) 0)))))) is different from false [2020-12-09 12:36:19,783 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2020-12-09 12:36:21,533 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2020-12-09 12:36:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:36:38,106 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2020-12-09 12:36:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 12:36:38,109 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 44 [2020-12-09 12:36:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:36:38,110 INFO L225 Difference]: With dead ends: 88 [2020-12-09 12:36:38,110 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 12:36:38,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 114.4s TimeCoverageRelationStatistics Valid=339, Invalid=3119, Unknown=24, NotChecked=1920, Total=5402 [2020-12-09 12:36:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 12:36:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-12-09 12:36:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 12:36:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-12-09 12:36:38,113 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 44 [2020-12-09 12:36:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:36:38,113 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-12-09 12:36:38,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2020-12-09 12:36:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-12-09 12:36:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 12:36:38,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:36:38,114 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:36:38,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:36:38,316 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:36:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:36:38,317 INFO L82 PathProgramCache]: Analyzing trace with hash 211016516, now seen corresponding path program 2 times [2020-12-09 12:36:38,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:36:38,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049660078] [2020-12-09 12:36:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:36:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:36:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 12:36:38,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049660078] [2020-12-09 12:36:38,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6019672] [2020-12-09 12:36:38,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:36:38,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 12:36:38,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:36:38,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 65 conjunts are in the unsatisfiable core [2020-12-09 12:36:38,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:36:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:36:39,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:36:41,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_142 Int) (v_DerPreprocessor_43 Int)) (or (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_142 v_DerPreprocessor_43) (+ c_ULTIMATE.start_main_~s~0.offset 4))) 1) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_142))) (forall ((v_DerPreprocessor_44 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_142 Int)) (or (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_142 v_DerPreprocessor_44) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_142)))) is different from false [2020-12-09 12:36:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2020-12-09 12:36:58,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1939085645] [2020-12-09 12:36:58,537 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-12-09 12:36:58,537 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:36:58,537 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:36:58,538 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:36:58,538 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:36:58,699 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:36:59,163 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:36:59,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:37:00,369 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:37:00,693 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:37:00,915 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:37:01,316 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 12:37:01,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:37:01,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 14] total 21 [2020-12-09 12:37:01,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085359937] [2020-12-09 12:37:01,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 12:37:01,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:37:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 12:37:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2020-12-09 12:37:01,318 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 21 states. [2020-12-09 12:37:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:37:01,780 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-12-09 12:37:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:37:01,780 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2020-12-09 12:37:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:37:01,781 INFO L225 Difference]: With dead ends: 12 [2020-12-09 12:37:01,781 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 12:37:01,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=76, Invalid=479, Unknown=1, NotChecked=44, Total=600 [2020-12-09 12:37:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 12:37:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 12:37:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 12:37:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 12:37:01,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2020-12-09 12:37:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:37:01,782 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 12:37:01,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 12:37:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 12:37:01,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 12:37:01,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1091 [2020-12-09 12:37:01,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:37:01 BoogieIcfgContainer [2020-12-09 12:37:01,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 12:37:01,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 12:37:01,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 12:37:01,997 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 12:37:01,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:35" (3/4) ... [2020-12-09 12:37:02,002 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 12:37:02,010 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2020-12-09 12:37:02,010 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-12-09 12:37:02,011 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 12:37:02,011 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 12:37:02,036 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_49cd41ab-99e3-45eb-87a8-366e7f435fcc/bin/utaipan/witness.graphml [2020-12-09 12:37:02,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 12:37:02,037 INFO L168 Benchmark]: Toolchain (without parser) took 747193.57 ms. Allocated memory was 102.8 MB in the beginning and 218.1 MB in the end (delta: 115.3 MB). Free memory was 79.8 MB in the beginning and 57.6 MB in the end (delta: 22.2 MB). Peak memory consumption was 139.0 MB. Max. memory is 16.1 GB. [2020-12-09 12:37:02,037 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 83.9 MB. Free memory is still 60.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 12:37:02,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.52 ms. Allocated memory is still 102.8 MB. Free memory was 79.8 MB in the beginning and 57.1 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:37:02,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.80 ms. Allocated memory is still 102.8 MB. Free memory was 57.1 MB in the beginning and 55.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:37:02,037 INFO L168 Benchmark]: Boogie Preprocessor took 30.99 ms. Allocated memory is still 102.8 MB. Free memory was 54.8 MB in the beginning and 53.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:37:02,037 INFO L168 Benchmark]: RCFGBuilder took 453.02 ms. Allocated memory is still 102.8 MB. Free memory was 53.3 MB in the beginning and 49.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 16.1 GB. [2020-12-09 12:37:02,037 INFO L168 Benchmark]: TraceAbstraction took 746338.37 ms. Allocated memory was 102.8 MB in the beginning and 218.1 MB in the end (delta: 115.3 MB). Free memory was 49.0 MB in the beginning and 61.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 104.7 MB. Max. memory is 16.1 GB. [2020-12-09 12:37:02,037 INFO L168 Benchmark]: Witness Printer took 40.39 ms. Allocated memory is still 218.1 MB. Free memory was 61.5 MB in the beginning and 57.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:37:02,038 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 83.9 MB. Free memory is still 60.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 293.52 ms. Allocated memory is still 102.8 MB. Free memory was 79.8 MB in the beginning and 57.1 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.80 ms. Allocated memory is still 102.8 MB. Free memory was 57.1 MB in the beginning and 55.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.99 ms. Allocated memory is still 102.8 MB. Free memory was 54.8 MB in the beginning and 53.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 453.02 ms. Allocated memory is still 102.8 MB. Free memory was 53.3 MB in the beginning and 49.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 746338.37 ms. Allocated memory was 102.8 MB in the beginning and 218.1 MB in the end (delta: 115.3 MB). Free memory was 49.0 MB in the beginning and 61.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 104.7 MB. Max. memory is 16.1 GB. * Witness Printer took 40.39 ms. Allocated memory is still 218.1 MB. Free memory was 61.5 MB in the beginning and 57.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 21 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 746.2s, OverallIterations: 31, TraceHistogramMax: 3, AutomataDifference: 138.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 847 SDtfs, 7052 SDslu, 3763 SDs, 0 SdLazy, 7157 SolverSat, 1117 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 30.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1499 GetRequests, 709 SyntacticMatches, 25 SemanticMatches, 765 ConstructedPredicates, 45 IntricatePredicates, 0 DeprecatedPredicates, 6575 ImplicationChecksByTransitivity, 644.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 557 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 567.7s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1641 ConstructedInterpolants, 187 QuantifiedInterpolants, 1152845 SizeOfPredicates, 420 NumberOfNonLiveVariables, 4382 ConjunctsInSsa, 828 ConjunctsInUnsatCore, 65 InterpolantComputations, 16 PerfectInterpolantSequences, 627/1016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 1535, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 10, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 20, TOOLS_POST_TIME[ms]: 1342, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 20, TOOLS_QUANTIFIERELIM_TIME[ms]: 1334, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 166, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 34, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME[ms]: 75, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 63, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 5, DOMAIN_ISBOTTOM_APPLICATIONS: 10, DOMAIN_ISBOTTOM_TIME[ms]: 16, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 731, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 731, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 1, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 7, DAG_COMPRESSION_PROCESSED_NODES: 107, DAG_COMPRESSION_RETAINED_NODES: 32, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...