./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e96d8d92db1667c6f6142560a7fad2417327f7e06eb532366f9ad7d4ddd7d1f5 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:37:07,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:37:07,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:37:07,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:37:07,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:37:07,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:37:07,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:37:07,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:37:07,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:37:07,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:37:07,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:37:07,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:37:07,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:37:07,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:37:07,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:37:07,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:37:07,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:37:07,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:37:07,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:37:07,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:37:07,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:37:07,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:37:07,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:37:07,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:37:07,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:37:07,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:37:07,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:37:07,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:37:07,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:37:07,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:37:07,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:37:07,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:37:07,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:37:07,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:37:07,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:37:07,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:37:07,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:37:07,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:37:07,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:37:07,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:37:07,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:37:07,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 13:37:07,300 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:37:07,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:37:07,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:37:07,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:37:07,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:37:07,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:37:07,303 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:37:07,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:37:07,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 13:37:07,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:37:07,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:37:07,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:37:07,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:37:07,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:37:07,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:37:07,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:37:07,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:37:07,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:37:07,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:37:07,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:37:07,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:37:07,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:37:07,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:37:07,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 13:37:07,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 13:37:07,306 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:37:07,306 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:37:07,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:37:07,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:37:07,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e96d8d92db1667c6f6142560a7fad2417327f7e06eb532366f9ad7d4ddd7d1f5 [2021-11-02 13:37:07,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:37:07,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:37:07,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:37:07,534 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:37:07,534 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:37:07,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i [2021-11-02 13:37:07,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5c5b58b/b8947658d0f14739939297841751ea2b/FLAG001d97c2c [2021-11-02 13:37:08,141 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:37:08,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i [2021-11-02 13:37:08,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5c5b58b/b8947658d0f14739939297841751ea2b/FLAG001d97c2c [2021-11-02 13:37:08,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5c5b58b/b8947658d0f14739939297841751ea2b [2021-11-02 13:37:08,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:37:08,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:37:08,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:37:08,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:37:08,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:37:08,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:37:08" (1/1) ... [2021-11-02 13:37:08,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c3c5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:08, skipping insertion in model container [2021-11-02 13:37:08,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:37:08" (1/1) ... [2021-11-02 13:37:08,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:37:08,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:37:08,622 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4500,4513] [2021-11-02 13:37:08,626 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4560,4573] [2021-11-02 13:37:08,636 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:37:08,639 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:37:09,188 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,189 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,189 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,189 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,190 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,200 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,201 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,202 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,203 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,204 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,205 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,206 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,206 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,410 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:37:09,411 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:37:09,411 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:37:09,412 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:37:09,413 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:37:09,413 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:37:09,414 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:37:09,414 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:37:09,416 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:37:09,420 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:37:09,509 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:37:09,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:37:09,536 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:37:09,548 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4500,4513] [2021-11-02 13:37:09,549 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4560,4573] [2021-11-02 13:37:09,550 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:37:09,550 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:37:09,580 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,580 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,580 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,581 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,581 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,584 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,585 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,585 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:37:09,603 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:37:09,604 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:37:09,605 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:37:09,605 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:37:09,605 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:37:09,606 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:37:09,606 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:37:09,606 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:37:09,607 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:37:09,607 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:37:09,618 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:37:09,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:37:09,784 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:37:09,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09 WrapperNode [2021-11-02 13:37:09,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:37:09,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:37:09,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:37:09,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:37:09,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:37:09,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:37:09,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:37:09,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:37:09,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:37:09,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:37:09,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:37:09,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:37:09,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (1/1) ... [2021-11-02 13:37:09,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:37:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:37:09,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 13:37:09,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 13:37:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:37:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 13:37:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:37:09,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:37:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:37:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:37:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 13:37:10,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:37:10,267 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-11-02 13:37:10,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:37:10 BoogieIcfgContainer [2021-11-02 13:37:10,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:37:10,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:37:10,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:37:10,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:37:10,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:37:08" (1/3) ... [2021-11-02 13:37:10,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ac571d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:37:10, skipping insertion in model container [2021-11-02 13:37:10,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:37:09" (2/3) ... [2021-11-02 13:37:10,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ac571d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:37:10, skipping insertion in model container [2021-11-02 13:37:10,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:37:10" (3/3) ... [2021-11-02 13:37:10,277 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_node_reset_harness-1.i [2021-11-02 13:37:10,280 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:37:10,281 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-02 13:37:10,309 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:37:10,313 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 13:37:10,313 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-02 13:37:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.5) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 13:37:10,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:37:10,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:37:10,326 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:37:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:37:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1935931966, now seen corresponding path program 1 times [2021-11-02 13:37:10,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:37:10,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147433294] [2021-11-02 13:37:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:10,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:37:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:10,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:37:10,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147433294] [2021-11-02 13:37:10,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147433294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:37:10,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:37:10,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 13:37:10,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489171153] [2021-11-02 13:37:10,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:37:10,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:37:10,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:37:10,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:37:10,609 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.5) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:37:10,693 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2021-11-02 13:37:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:37:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-02 13:37:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:37:10,699 INFO L225 Difference]: With dead ends: 59 [2021-11-02 13:37:10,700 INFO L226 Difference]: Without dead ends: 26 [2021-11-02 13:37:10,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:37:10,706 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.31ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.19ms IncrementalHoareTripleChecker+Time [2021-11-02 13:37:10,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.31ms Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 70.19ms Time] [2021-11-02 13:37:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-02 13:37:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-02 13:37:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-11-02 13:37:10,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2021-11-02 13:37:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:37:10,742 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-02 13:37:10,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-11-02 13:37:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-02 13:37:10,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:37:10,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:37:10,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 13:37:10,748 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:37:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:37:10,750 INFO L85 PathProgramCache]: Analyzing trace with hash 712013687, now seen corresponding path program 1 times [2021-11-02 13:37:10,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:37:10,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829089726] [2021-11-02 13:37:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:10,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:37:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:10,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:37:10,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829089726] [2021-11-02 13:37:10,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829089726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:37:10,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:37:10,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 13:37:10,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307479184] [2021-11-02 13:37:10,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 13:37:10,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:37:10,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 13:37:10,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:37:10,832 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:37:10,914 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2021-11-02 13:37:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 13:37:10,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-02 13:37:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:37:10,916 INFO L225 Difference]: With dead ends: 48 [2021-11-02 13:37:10,916 INFO L226 Difference]: Without dead ends: 27 [2021-11-02 13:37:10,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.48ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:37:10,917 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.38ms IncrementalHoareTripleChecker+Time [2021-11-02 13:37:10,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.77ms Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 73.38ms Time] [2021-11-02 13:37:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-02 13:37:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-11-02 13:37:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-11-02 13:37:10,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2021-11-02 13:37:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:37:10,926 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-02 13:37:10,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-11-02 13:37:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 13:37:10,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:37:10,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:37:10,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 13:37:10,927 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:37:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:37:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1602855479, now seen corresponding path program 1 times [2021-11-02 13:37:10,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:37:10,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034113853] [2021-11-02 13:37:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:10,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:37:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 13:37:11,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:37:11,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034113853] [2021-11-02 13:37:11,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034113853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:37:11,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:37:11,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 13:37:11,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608590199] [2021-11-02 13:37:11,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 13:37:11,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:37:11,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 13:37:11,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:37:11,008 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:37:11,069 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2021-11-02 13:37:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 13:37:11,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-02 13:37:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:37:11,072 INFO L225 Difference]: With dead ends: 58 [2021-11-02 13:37:11,072 INFO L226 Difference]: Without dead ends: 43 [2021-11-02 13:37:11,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:37:11,076 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.44ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.26ms IncrementalHoareTripleChecker+Time [2021-11-02 13:37:11,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 1.44ms Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 49.26ms Time] [2021-11-02 13:37:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-11-02 13:37:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2021-11-02 13:37:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-02 13:37:11,082 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 14 [2021-11-02 13:37:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:37:11,082 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-02 13:37:11,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-02 13:37:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 13:37:11,083 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:37:11,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:37:11,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 13:37:11,083 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:37:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:37:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1604464193, now seen corresponding path program 1 times [2021-11-02 13:37:11,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:37:11,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681530118] [2021-11-02 13:37:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:11,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:37:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:11,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:37:11,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681530118] [2021-11-02 13:37:11,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681530118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:37:11,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634355090] [2021-11-02 13:37:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:11,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:37:11,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:37:11,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:37:11,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 13:37:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:11,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 13:37:11,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:37:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:11,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:37:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:11,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634355090] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:37:11,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 13:37:11,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-02 13:37:11,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348866071] [2021-11-02 13:37:11,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:37:11,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:37:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:37:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:37:11,401 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:37:11,486 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2021-11-02 13:37:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 13:37:11,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-02 13:37:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:37:11,490 INFO L225 Difference]: With dead ends: 55 [2021-11-02 13:37:11,490 INFO L226 Difference]: Without dead ends: 32 [2021-11-02 13:37:11,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 22.95ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:37:11,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.84ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.16ms IncrementalHoareTripleChecker+Time [2021-11-02 13:37:11,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 123 Unknown, 0 Unchecked, 1.84ms Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 62.16ms Time] [2021-11-02 13:37:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-02 13:37:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-02 13:37:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-11-02 13:37:11,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2021-11-02 13:37:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:37:11,502 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-11-02 13:37:11,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-11-02 13:37:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-02 13:37:11,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:37:11,503 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:37:11,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 13:37:11,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:37:11,716 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:37:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:37:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1021162369, now seen corresponding path program 2 times [2021-11-02 13:37:11,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:37:11,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477481595] [2021-11-02 13:37:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:11,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:37:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:11,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:37:11,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477481595] [2021-11-02 13:37:11,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477481595] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:37:11,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446462960] [2021-11-02 13:37:11,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 13:37:11,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:37:11,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:37:11,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:37:11,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 13:37:11,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 13:37:11,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 13:37:11,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 13:37:11,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:37:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:11,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:37:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:12,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446462960] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:37:12,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 13:37:12,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2021-11-02 13:37:12,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178560068] [2021-11-02 13:37:12,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 13:37:12,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:37:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 13:37:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=142, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:37:12,038 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:37:12,113 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-11-02 13:37:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 13:37:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-02 13:37:12,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:37:12,114 INFO L225 Difference]: With dead ends: 61 [2021-11-02 13:37:12,114 INFO L226 Difference]: Without dead ends: 38 [2021-11-02 13:37:12,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 78.85ms TimeCoverageRelationStatistics Valid=130, Invalid=142, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:37:12,115 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.99ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.02ms IncrementalHoareTripleChecker+Time [2021-11-02 13:37:12,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 0.99ms Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 68.02ms Time] [2021-11-02 13:37:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-02 13:37:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-02 13:37:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-11-02 13:37:12,118 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2021-11-02 13:37:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:37:12,118 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-11-02 13:37:12,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-11-02 13:37:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 13:37:12,119 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:37:12,119 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:37:12,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 13:37:12,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:37:12,339 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:37:12,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:37:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash -374883455, now seen corresponding path program 3 times [2021-11-02 13:37:12,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:37:12,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639908221] [2021-11-02 13:37:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:12,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:37:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:12,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:37:12,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639908221] [2021-11-02 13:37:12,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639908221] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:37:12,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557359370] [2021-11-02 13:37:12,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 13:37:12,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:37:12,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:37:12,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:37:12,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 13:37:12,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-02 13:37:12,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 13:37:12,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-02 13:37:12,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:37:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:12,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:37:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:13,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557359370] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:37:13,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 13:37:13,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2021-11-02 13:37:13,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660011642] [2021-11-02 13:37:13,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-02 13:37:13,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:37:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-02 13:37:13,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=423, Unknown=0, NotChecked=0, Total=756 [2021-11-02 13:37:13,075 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:37:13,176 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2021-11-02 13:37:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 13:37:13,177 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-02 13:37:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:37:13,177 INFO L225 Difference]: With dead ends: 66 [2021-11-02 13:37:13,177 INFO L226 Difference]: Without dead ends: 43 [2021-11-02 13:37:13,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 203.40ms TimeCoverageRelationStatistics Valid=333, Invalid=423, Unknown=0, NotChecked=0, Total=756 [2021-11-02 13:37:13,178 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.14ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.88ms IncrementalHoareTripleChecker+Time [2021-11-02 13:37:13,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 1.14ms Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 91.88ms Time] [2021-11-02 13:37:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-11-02 13:37:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-11-02 13:37:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2021-11-02 13:37:13,182 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2021-11-02 13:37:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:37:13,182 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2021-11-02 13:37:13,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:37:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2021-11-02 13:37:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 13:37:13,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:37:13,183 INFO L514 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:37:13,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 13:37:13,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:37:13,402 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:37:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:37:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1757952447, now seen corresponding path program 4 times [2021-11-02 13:37:13,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:37:13,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367762007] [2021-11-02 13:37:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:37:13,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:37:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:37:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 78 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:37:13,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:37:13,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367762007] [2021-11-02 13:37:13,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367762007] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:37:13,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713629157] [2021-11-02 13:37:13,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-02 13:37:13,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:37:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:37:13,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:37:13,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-02 13:37:14,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-02 13:37:14,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 13:37:14,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-02 13:37:14,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:37:14,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-02 13:37:14,634 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-02 13:37:14,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-02 13:37:14,746 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-02 13:37:14,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 45 [2021-11-02 13:37:14,903 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-02 13:37:14,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 62 [2021-11-02 13:37:15,094 INFO L354 Elim1Store]: treesize reduction 164, result has 17.6 percent of original size [2021-11-02 13:37:15,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 79 [2021-11-02 13:37:15,293 INFO L354 Elim1Store]: treesize reduction 236, result has 15.7 percent of original size [2021-11-02 13:37:15,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 96 [2021-11-02 13:37:15,566 INFO L354 Elim1Store]: treesize reduction 320, result has 14.2 percent of original size [2021-11-02 13:37:15,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 113 [2021-11-02 13:37:16,568 INFO L354 Elim1Store]: treesize reduction 416, result has 13.0 percent of original size [2021-11-02 13:37:16,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 113 treesize of output 130 [2021-11-02 13:37:31,974 INFO L354 Elim1Store]: treesize reduction 524, result has 11.9 percent of original size [2021-11-02 13:37:31,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 127 treesize of output 147 [2021-11-02 13:38:01,515 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-02 13:38:01,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-02 13:38:01,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-02 13:38:01,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-02 13:38:01,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2021-11-02 13:38:01,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236483425] [2021-11-02 13:38:01,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-02 13:38:01,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:38:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-02 13:38:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=634, Unknown=3, NotChecked=0, Total=930 [2021-11-02 13:38:01,519 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:38:01,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 16504.91ms TimeCoverageRelationStatistics Valid=293, Invalid=634, Unknown=3, NotChecked=0, Total=930 [2021-11-02 13:38:01,520 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-02 13:38:01,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.02ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-02 13:38:01,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-02 13:38:01,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:38:01,732 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@408e81ef at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-02 13:38:01,735 INFO L158 Benchmark]: Toolchain (without parser) took 53378.57ms. Allocated memory was 92.3MB in the beginning and 205.5MB in the end (delta: 113.2MB). Free memory was 55.6MB in the beginning and 106.9MB in the end (delta: -51.3MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2021-11-02 13:38:01,735 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 13:38:01,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1427.90ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 55.2MB in the beginning and 63.6MB in the end (delta: -8.4MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2021-11-02 13:38:01,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.48ms. Allocated memory is still 121.6MB. Free memory was 63.6MB in the beginning and 58.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-02 13:38:01,735 INFO L158 Benchmark]: Boogie Preprocessor took 52.14ms. Allocated memory is still 121.6MB. Free memory was 58.7MB in the beginning and 56.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-02 13:38:01,736 INFO L158 Benchmark]: RCFGBuilder took 327.68ms. Allocated memory is still 121.6MB. Free memory was 56.6MB in the beginning and 80.5MB in the end (delta: -23.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-02 13:38:01,736 INFO L158 Benchmark]: TraceAbstraction took 51465.33ms. Allocated memory was 121.6MB in the beginning and 205.5MB in the end (delta: 83.9MB). Free memory was 79.7MB in the beginning and 106.9MB in the end (delta: -27.2MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2021-11-02 13:38:01,737 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.18ms. Allocated memory is still 92.3MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1427.90ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 55.2MB in the beginning and 63.6MB in the end (delta: -8.4MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.48ms. Allocated memory is still 121.6MB. Free memory was 63.6MB in the beginning and 58.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.14ms. Allocated memory is still 121.6MB. Free memory was 58.7MB in the beginning and 56.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 327.68ms. Allocated memory is still 121.6MB. Free memory was 56.6MB in the beginning and 80.5MB in the end (delta: -23.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 51465.33ms. Allocated memory was 121.6MB in the beginning and 205.5MB in the end (delta: 83.9MB). Free memory was 79.7MB in the beginning and 106.9MB in the end (delta: -27.2MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@408e81ef de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@408e81ef: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e96d8d92db1667c6f6142560a7fad2417327f7e06eb532366f9ad7d4ddd7d1f5 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:38:03,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:38:03,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:38:03,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:38:03,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:38:03,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:38:03,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:38:03,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:38:03,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:38:03,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:38:03,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:38:03,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:38:03,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:38:03,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:38:03,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:38:03,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:38:03,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:38:03,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:38:03,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:38:03,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:38:03,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:38:03,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:38:03,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:38:03,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:38:03,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:38:03,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:38:03,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:38:03,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:38:03,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:38:03,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:38:03,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:38:03,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:38:03,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:38:03,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:38:03,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:38:03,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:38:03,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:38:03,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:38:03,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:38:03,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:38:03,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:38:03,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 13:38:03,199 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:38:03,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:38:03,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:38:03,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:38:03,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:38:03,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:38:03,203 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:38:03,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:38:03,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:38:03,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:38:03,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:38:03,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:38:03,204 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 13:38:03,204 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 13:38:03,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:38:03,204 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:38:03,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:38:03,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:38:03,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:38:03,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:38:03,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:38:03,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:38:03,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:38:03,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:38:03,206 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 13:38:03,206 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 13:38:03,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:38:03,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:38:03,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:38:03,207 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:38:03,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 13:38:03,207 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e96d8d92db1667c6f6142560a7fad2417327f7e06eb532366f9ad7d4ddd7d1f5 [2021-11-02 13:38:03,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:38:03,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:38:03,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:38:03,481 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:38:03,482 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:38:03,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i [2021-11-02 13:38:03,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096ccc944/c3ba8e961b044e04bb7b5b45c0ad1ccc/FLAGe3a44abc0 [2021-11-02 13:38:04,066 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:38:04,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i [2021-11-02 13:38:04,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096ccc944/c3ba8e961b044e04bb7b5b45c0ad1ccc/FLAGe3a44abc0 [2021-11-02 13:38:04,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096ccc944/c3ba8e961b044e04bb7b5b45c0ad1ccc [2021-11-02 13:38:04,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:38:04,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:38:04,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:38:04,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:38:04,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:38:04,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:38:04" (1/1) ... [2021-11-02 13:38:04,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51945f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:04, skipping insertion in model container [2021-11-02 13:38:04,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:38:04" (1/1) ... [2021-11-02 13:38:04,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:38:04,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:38:04,829 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4500,4513] [2021-11-02 13:38:04,835 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4560,4573] [2021-11-02 13:38:04,853 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:38:04,859 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:38:05,265 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,266 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,267 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,268 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,268 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,278 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,280 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,281 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,281 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,282 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,283 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,284 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,284 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,465 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:38:05,466 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:38:05,466 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:38:05,467 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:38:05,468 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:38:05,468 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:38:05,469 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:38:05,469 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:38:05,469 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:38:05,470 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:38:05,553 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:38:05,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:38:05,583 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:38:05,596 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4500,4513] [2021-11-02 13:38:05,597 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4560,4573] [2021-11-02 13:38:05,598 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:38:05,602 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:38:05,652 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,653 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,653 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,656 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,656 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,663 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,667 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,672 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,672 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,673 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,673 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,673 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,673 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:38:05,694 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:38:05,695 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:38:05,696 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:38:05,696 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:38:05,697 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:38:05,697 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:38:05,697 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:38:05,698 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:38:05,698 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:38:05,698 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:38:05,712 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:38:05,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:38:05,908 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:38:05,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05 WrapperNode [2021-11-02 13:38:05,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:38:05,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:38:05,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:38:05,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:38:05,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:05,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:38:06,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:38:06,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:38:06,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:38:06,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:38:06,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:38:06,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:38:06,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:38:06,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (1/1) ... [2021-11-02 13:38:06,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:38:06,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:38:06,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 13:38:06,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 13:38:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 13:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:38:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:38:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 13:38:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:38:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:38:06,407 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:38:06,408 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-11-02 13:38:06,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:38:06 BoogieIcfgContainer [2021-11-02 13:38:06,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:38:06,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:38:06,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:38:06,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:38:06,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:38:04" (1/3) ... [2021-11-02 13:38:06,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae5f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:38:06, skipping insertion in model container [2021-11-02 13:38:06,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:38:05" (2/3) ... [2021-11-02 13:38:06,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae5f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:38:06, skipping insertion in model container [2021-11-02 13:38:06,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:38:06" (3/3) ... [2021-11-02 13:38:06,417 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_node_reset_harness-1.i [2021-11-02 13:38:06,420 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:38:06,420 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-02 13:38:06,460 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:38:06,465 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 13:38:06,465 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-02 13:38:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.5) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 13:38:06,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:38:06,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:38:06,478 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:38:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:38:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1935931966, now seen corresponding path program 1 times [2021-11-02 13:38:06,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:38:06,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317485373] [2021-11-02 13:38:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:38:06,497 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:38:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:38:06,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:38:06,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 13:38:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:38:06,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-02 13:38:06,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:38:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:06,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:38:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:06,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:38:06,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317485373] [2021-11-02 13:38:06,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317485373] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:38:06,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:38:06,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 13:38:06,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029728477] [2021-11-02 13:38:06,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:38:06,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:38:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:38:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:38:06,797 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.5) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:38:06,905 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2021-11-02 13:38:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:38:06,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-02 13:38:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:38:06,912 INFO L225 Difference]: With dead ends: 59 [2021-11-02 13:38:06,912 INFO L226 Difference]: Without dead ends: 26 [2021-11-02 13:38:06,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.07ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:38:06,916 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.28ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.84ms IncrementalHoareTripleChecker+Time [2021-11-02 13:38:06,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.28ms Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 96.84ms Time] [2021-11-02 13:38:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-02 13:38:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-02 13:38:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-11-02 13:38:06,938 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2021-11-02 13:38:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:38:06,938 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-02 13:38:06,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-11-02 13:38:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-02 13:38:06,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:38:06,938 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:38:06,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-02 13:38:07,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:38:07,140 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:38:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:38:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 712013687, now seen corresponding path program 1 times [2021-11-02 13:38:07,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:38:07,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685354568] [2021-11-02 13:38:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:38:07,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:38:07,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:38:07,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:38:07,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 13:38:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:38:07,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 13:38:07,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:38:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:07,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:38:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:07,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:38:07,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685354568] [2021-11-02 13:38:07,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685354568] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:38:07,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:38:07,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 13:38:07,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434678006] [2021-11-02 13:38:07,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:38:07,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:38:07,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:38:07,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:38:07,391 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:38:07,528 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2021-11-02 13:38:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:38:07,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-02 13:38:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:38:07,529 INFO L225 Difference]: With dead ends: 49 [2021-11-02 13:38:07,529 INFO L226 Difference]: Without dead ends: 28 [2021-11-02 13:38:07,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.55ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:38:07,530 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.06ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 125.73ms IncrementalHoareTripleChecker+Time [2021-11-02 13:38:07,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 1.06ms Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 125.73ms Time] [2021-11-02 13:38:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-02 13:38:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-02 13:38:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-11-02 13:38:07,534 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2021-11-02 13:38:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:38:07,534 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-02 13:38:07,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-11-02 13:38:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 13:38:07,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:38:07,544 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:38:07,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 13:38:07,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:38:07,752 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:38:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:38:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash -845820041, now seen corresponding path program 1 times [2021-11-02 13:38:07,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:38:07,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641583103] [2021-11-02 13:38:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:38:07,753 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:38:07,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:38:07,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:38:07,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 13:38:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:38:07,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 13:38:07,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:38:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:07,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:38:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:08,065 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:38:08,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641583103] [2021-11-02 13:38:08,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641583103] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:38:08,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 13:38:08,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-02 13:38:08,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473450472] [2021-11-02 13:38:08,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:38:08,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:38:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:38:08,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:38:08,067 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:38:08,427 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2021-11-02 13:38:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 13:38:08,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-02 13:38:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:38:08,428 INFO L225 Difference]: With dead ends: 53 [2021-11-02 13:38:08,428 INFO L226 Difference]: Without dead ends: 32 [2021-11-02 13:38:08,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 255.32ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-02 13:38:08,429 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 173.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 212.20ms IncrementalHoareTripleChecker+Time [2021-11-02 13:38:08,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 212.20ms Time] [2021-11-02 13:38:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-02 13:38:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-02 13:38:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-11-02 13:38:08,433 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 15 [2021-11-02 13:38:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:38:08,434 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-11-02 13:38:08,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-11-02 13:38:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-02 13:38:08,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:38:08,435 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:38:08,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-02 13:38:08,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:38:08,645 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:38:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:38:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1652654217, now seen corresponding path program 2 times [2021-11-02 13:38:08,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:38:08,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113952909] [2021-11-02 13:38:08,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 13:38:08,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:38:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:38:08,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:38:08,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 13:38:08,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-02 13:38:08,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 13:38:08,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 13:38:08,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:38:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-02 13:38:08,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:38:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-02 13:38:08,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:38:08,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113952909] [2021-11-02 13:38:08,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113952909] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:38:08,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:38:08,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 13:38:08,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072183409] [2021-11-02 13:38:08,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:38:08,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:38:08,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:38:08,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:38:08,829 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:38:08,950 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2021-11-02 13:38:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:38:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-02 13:38:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:38:08,952 INFO L225 Difference]: With dead ends: 75 [2021-11-02 13:38:08,952 INFO L226 Difference]: Without dead ends: 60 [2021-11-02 13:38:08,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.60ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:38:08,953 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.97ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112.34ms IncrementalHoareTripleChecker+Time [2021-11-02 13:38:08,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 80 Unknown, 0 Unchecked, 0.97ms Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 112.34ms Time] [2021-11-02 13:38:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-02 13:38:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2021-11-02 13:38:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2021-11-02 13:38:08,957 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 19 [2021-11-02 13:38:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:38:08,958 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2021-11-02 13:38:08,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2021-11-02 13:38:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-02 13:38:08,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:38:08,958 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:38:08,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-02 13:38:09,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:38:09,159 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:38:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:38:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1651045503, now seen corresponding path program 1 times [2021-11-02 13:38:09,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:38:09,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486154780] [2021-11-02 13:38:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:38:09,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:38:09,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:38:09,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:38:09,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 13:38:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:38:09,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 13:38:09,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:38:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:09,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:38:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:09,907 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:38:09,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486154780] [2021-11-02 13:38:09,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486154780] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:38:09,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 13:38:09,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-02 13:38:09,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791755979] [2021-11-02 13:38:09,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:38:09,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:38:09,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:38:09,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:38:09,908 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:38:11,378 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2021-11-02 13:38:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 13:38:11,379 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-02 13:38:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:38:11,379 INFO L225 Difference]: With dead ends: 77 [2021-11-02 13:38:11,380 INFO L226 Difference]: Without dead ends: 48 [2021-11-02 13:38:11,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1439.82ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-02 13:38:11,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 450.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.76ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 531.67ms IncrementalHoareTripleChecker+Time [2021-11-02 13:38:11,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 2.76ms Time], IncrementalHoareTripleChecker [13 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 531.67ms Time] [2021-11-02 13:38:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-02 13:38:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-11-02 13:38:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2021-11-02 13:38:11,388 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 19 [2021-11-02 13:38:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:38:11,388 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2021-11-02 13:38:11,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2021-11-02 13:38:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 13:38:11,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:38:11,389 INFO L514 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:38:11,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-02 13:38:11,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:38:11,600 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:38:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:38:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1574988673, now seen corresponding path program 2 times [2021-11-02 13:38:11,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:38:11,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540946380] [2021-11-02 13:38:11,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 13:38:11,601 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:38:11,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:38:11,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:38:11,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 13:38:11,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 13:38:11,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 13:38:11,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-02 13:38:11,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:38:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:12,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:38:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:13,868 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:38:13,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540946380] [2021-11-02 13:38:13,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540946380] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:38:13,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 13:38:13,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-02 13:38:13,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44276971] [2021-11-02 13:38:13,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-02 13:38:13,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:38:13,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-02 13:38:13,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2021-11-02 13:38:13,870 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:38:15,007 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-11-02 13:38:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 13:38:15,007 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-02 13:38:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:38:15,008 INFO L225 Difference]: With dead ends: 78 [2021-11-02 13:38:15,008 INFO L226 Difference]: Without dead ends: 49 [2021-11-02 13:38:15,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1893.98ms TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2021-11-02 13:38:15,009 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 948.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.61ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1116.57ms IncrementalHoareTripleChecker+Time [2021-11-02 13:38:15,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 740 Unknown, 0 Unchecked, 2.61ms Time], IncrementalHoareTripleChecker [14 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1116.57ms Time] [2021-11-02 13:38:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-02 13:38:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-11-02 13:38:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2021-11-02 13:38:15,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 27 [2021-11-02 13:38:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:38:15,013 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2021-11-02 13:38:15,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:38:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2021-11-02 13:38:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 13:38:15,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:38:15,014 INFO L514 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:38:15,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-02 13:38:15,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:38:15,227 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:38:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:38:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1757952447, now seen corresponding path program 3 times [2021-11-02 13:38:15,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:38:15,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857632122] [2021-11-02 13:38:15,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 13:38:15,229 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:38:15,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:38:15,229 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:38:15,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-02 13:38:15,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-02 13:38:15,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 13:38:15,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-02 13:38:15,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:38:15,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-02 13:38:15,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-11-02 13:38:15,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-11-02 13:38:15,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-11-02 13:38:15,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:15,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2021-11-02 13:38:16,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 80 [2021-11-02 13:38:16,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 95 [2021-11-02 13:38:16,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 110 [2021-11-02 13:38:16,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:16,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 122 [2021-11-02 13:38:17,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 137 [2021-11-02 13:38:17,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 150 [2021-11-02 13:38:17,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:17,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 165 [2021-11-02 13:38:18,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 178 [2021-11-02 13:38:18,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:18,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:38:19,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 193 [2021-11-02 13:38:20,698 INFO L354 Elim1Store]: treesize reduction 1424, result has 8.1 percent of original size [2021-11-02 13:38:20,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 105 case distinctions, treesize of input 138 treesize of output 176 [2021-11-02 13:38:22,702 INFO L354 Elim1Store]: treesize reduction 1232, result has 0.1 percent of original size [2021-11-02 13:38:22,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 142 treesize of output 50 [2021-11-02 13:38:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:38:22,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:40:08,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 982506 treesize of output 982502 [2021-11-02 13:40:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:40:34,619 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:40:34,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857632122] [2021-11-02 13:40:34,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857632122] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:40:34,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 13:40:34,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2021-11-02 13:40:34,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073507837] [2021-11-02 13:40:34,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-02 13:40:34,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:40:34,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-02 13:40:34,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1031, Unknown=3, NotChecked=0, Total=1332 [2021-11-02 13:40:34,621 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:40:45,335 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse10 (store .cse5 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse7 (store .cse10 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse12 (store .cse7 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse14 (store .cse12 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse13 (store .cse14 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse4))) (let ((.cse0 (store .cse13 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse4))) (let ((.cse6 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse8 (store .cse6 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse1 (store .cse8 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse9 (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse11 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv11 64)) .cse4))) (let ((.cse3 (store .cse11 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv12 64)) .cse4)) (.cse2 (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 32) (select .cse2 (bvadd (_ bv8 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse3 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv13 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse6) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv4 64))) (_ bv0 32)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv5 64))) (_ bv0 32)) (= (_ bv0 32) (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv7 64)))) (= (_ bv0 32) (select .cse2 (bvadd (_ bv14 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd (_ bv10 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 32)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv1 64))) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv12 64))) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse11) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset) (_ bv0 32)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv9 64))) (_ bv0 32)) (= (select .cse2 (bvadd (_ bv3 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse12) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse13) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv6 64))) (_ bv0 32)) (= (_ bv0 32) (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv2 64)))) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv13 64))) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse14) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv11 64))) (_ bv0 32))))))))))))))))) is different from false [2021-11-02 13:40:47,349 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse10 (store .cse5 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse7 (store .cse10 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse12 (store .cse7 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse14 (store .cse12 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse13 (store .cse14 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse4))) (let ((.cse0 (store .cse13 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse4))) (let ((.cse6 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse8 (store .cse6 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse1 (store .cse8 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse9 (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4))) (let ((.cse11 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv11 64)) .cse4))) (let ((.cse3 (store .cse11 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv12 64)) .cse4)) (.cse2 (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 32) (select .cse2 (bvadd (_ bv8 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse3 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv13 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse4)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse6) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv4 64))) (_ bv0 32)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv5 64))) (_ bv0 32)) (= (_ bv0 32) (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv7 64)))) (= (_ bv0 32) (select .cse2 (bvadd (_ bv14 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd (_ bv10 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 32)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv1 64))) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv12 64))) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse11) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset) (_ bv0 32)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv9 64))) (_ bv0 32)) (= (select .cse2 (bvadd (_ bv3 64) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse12) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse13) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv6 64))) (_ bv0 32)) (= (_ bv0 32) (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv2 64)))) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv13 64))) (_ bv0 32)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse14) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (select .cse2 (bvadd c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset (_ bv11 64))) (_ bv0 32))))))))))))))))) is different from true [2021-11-02 13:40:49,363 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse9 (store .cse2 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse4 (store .cse9 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse10 (store .cse4 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse12 (store .cse10 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse11 (store .cse12 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse6))) (let ((.cse0 (store .cse11 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse6))) (let ((.cse3 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse7 (store .cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse1 (store .cse7 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse8 (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse5 (store .cse8 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv11 64)) .cse6))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse2) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse5 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv12 64)) .cse6)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse11) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse12) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)))))))))))))))) is different from false [2021-11-02 13:40:51,377 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse9 (store .cse2 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse4 (store .cse9 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse10 (store .cse4 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse12 (store .cse10 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse11 (store .cse12 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse6))) (let ((.cse0 (store .cse11 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse6))) (let ((.cse3 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse7 (store .cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse1 (store .cse7 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse8 (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse5 (store .cse8 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv11 64)) .cse6))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse2) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse5 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv12 64)) .cse6)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse11) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse12) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)))))))))))))))) is different from true [2021-11-02 13:40:53,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse7 (store .cse2 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse4 (store .cse7 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse9 (store .cse4 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse11 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse10 (store .cse11 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse8))) (let ((.cse0 (store .cse10 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse8))) (let ((.cse3 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse5 (store .cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse1 (store .cse5 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse6 (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse2) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse6) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse6 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv11 64)) .cse8)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse11) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8))))))))))))))) is different from false [2021-11-02 13:40:55,403 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse7 (store .cse2 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse4 (store .cse7 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse9 (store .cse4 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse11 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse10 (store .cse11 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse8))) (let ((.cse0 (store .cse10 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse8))) (let ((.cse3 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse5 (store .cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse1 (store .cse5 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (let ((.cse6 (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse8))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse2) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse6) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse6 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv11 64)) .cse8)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse11) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8))))))))))))))) is different from true [2021-11-02 13:40:57,333 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:40:59,342 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:00,690 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:02,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:06,285 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse7 (store .cse2 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse4 (store .cse7 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse8 (store .cse4 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse10 (store .cse8 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse9 (store .cse10 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse6))) (let ((.cse0 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse6))) (let ((.cse3 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse5 (store .cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse1 (store .cse5 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse2) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)))))))))))))) is different from false [2021-11-02 13:41:08,297 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse7 (store .cse2 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse4 (store .cse7 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse8 (store .cse4 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse10 (store .cse8 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse9 (store .cse10 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse6))) (let ((.cse0 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse6))) (let ((.cse3 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse5 (store .cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (let ((.cse1 (store .cse5 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse2) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse1 (bvadd (_ bv10 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse6)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse10) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)))))))))))))) is different from true [2021-11-02 13:41:09,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:12,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:13,358 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:15,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:17,524 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:19,418 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:21,085 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:41:22,357 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:08,312 WARN L210 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2021-11-02 13:42:12,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:14,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:15,991 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:18,047 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:21,175 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:43,003 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:44,731 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:42:45,748 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:43:15,598 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:43:16,977 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:43:20,228 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:43:28,025 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:43:31,424 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:43:59,264 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:03,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:14,444 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:37,209 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:40,475 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:45,220 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:48,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:50,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:44:52,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:45:07,112 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:45:11,453 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse6 (store .cse3 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse5 (store .cse6 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse7 (store .cse5 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse9 (store .cse7 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse8 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse2))) (let ((.cse0 (store .cse8 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse2))) (let ((.cse4 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse1 (store .cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse1 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse6) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_is_mem_zeroed_~buf_u8~0.base) (bvadd c_ULTIMATE.start_aws_is_mem_zeroed_~i~0 c_ULTIMATE.start_aws_is_mem_zeroed_~buf_u8~0.offset))) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8))))))))))))) is different from false [2021-11-02 13:45:13,464 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse6 (store .cse3 (bvadd (_ bv1 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse5 (store .cse6 (bvadd (_ bv2 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse7 (store .cse5 (bvadd (_ bv3 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse9 (store .cse7 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv4 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse8 (store .cse9 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv5 64)) .cse2))) (let ((.cse0 (store .cse8 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| (_ bv6 64)) .cse2))) (let ((.cse4 (store .cse0 (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| (_ bv7 64) |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (let ((.cse1 (store .cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2))) (and (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse0) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store .cse1 (bvadd (_ bv9 64) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr680| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) .cse2)) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse3) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse4) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse5) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse1) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse6) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_aws_is_mem_zeroed_~buf_u8~0.base) (bvadd c_ULTIMATE.start_aws_is_mem_zeroed_~i~0 c_ULTIMATE.start_aws_is_mem_zeroed_~buf_u8~0.offset))) (_ bv0 8)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse7) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse8) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| .cse9) c_ULTIMATE.start_aws_linked_list_node_reset_~node.base) c_ULTIMATE.start_aws_linked_list_node_reset_~node.offset)) (_ bv0 8))))))))))))) is different from true [2021-11-02 13:45:15,274 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:45:16,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:45:17,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:46:15,937 WARN L210 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2021-11-02 13:47:00,570 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:47:01,671 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:47:36,793 WARN L210 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2021-11-02 13:48:45,218 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:48:46,498 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:48:51,127 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:49:46,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:49:47,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:49:48,788 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:49:50,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:49:53,708 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:49:54,918 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:49:59,640 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:50:00,880 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:50:04,506 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:50:05,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:50:52,150 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:50:55,901 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:50:57,713 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:51:01,703 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:51:03,909 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:51:05,308 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:51:42,697 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:51:43,704 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:51:45,559 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15