./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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_hash_table_clean_up_harness.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 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:07:02,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:07:02,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:07:02,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:07:02,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:07:02,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:07:02,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:07:02,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:07:02,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:07:02,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:07:02,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:07:02,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:07:02,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:07:02,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:07:02,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:07:02,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:07:02,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:07:02,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:07:02,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:07:02,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:07:02,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:07:02,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:07:02,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:07:02,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:07:02,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:07:02,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:07:02,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:07:02,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:07:02,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:07:02,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:07:02,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:07:02,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:07:02,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:07:02,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:07:02,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:07:02,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:07:02,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:07:02,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:07:02,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:07:02,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:07:02,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:07:02,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 21:07:02,225 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:07:02,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:07:02,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:07:02,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:07:02,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:07:02,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:07:02,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:07:02,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:07:02,228 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:07:02,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:07:02,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:07:02,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:07:02,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:07:02,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:07:02,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:07:02,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:07:02,230 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:07:02,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:07:02,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:07:02,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:07:02,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:07:02,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:07:02,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:07:02,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:07:02,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:07:02,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:07:02,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:07:02,232 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:07:02,232 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:07:02,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:07:02,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:07:02,233 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 -> 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 [2021-11-16 21:07:02,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:07:02,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:07:02,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:07:02,455 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:07:02,456 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:07:02,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-16 21:07:02,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0042868c0/28f02a8252c24ad08b886b7e7771037d/FLAG27ad7f9f4 [2021-11-16 21:07:03,050 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:07:03,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-16 21:07:03,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0042868c0/28f02a8252c24ad08b886b7e7771037d/FLAG27ad7f9f4 [2021-11-16 21:07:03,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0042868c0/28f02a8252c24ad08b886b7e7771037d [2021-11-16 21:07:03,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:07:03,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:07:03,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:07:03,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:07:03,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:07:03,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:07:03" (1/1) ... [2021-11-16 21:07:03,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722879e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:03, skipping insertion in model container [2021-11-16 21:07:03,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:07:03" (1/1) ... [2021-11-16 21:07:03,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:07:03,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:07:03,549 WARN L230 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_hash_table_clean_up_harness.i[4497,4510] [2021-11-16 21:07:03,556 WARN L230 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_hash_table_clean_up_harness.i[4557,4570] [2021-11-16 21:07:03,582 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:07:03,590 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:07:04,177 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,178 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,178 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,179 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,180 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,189 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,199 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,200 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,201 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,202 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,202 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,203 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,203 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,447 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:07:04,448 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:07:04,449 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:07:04,450 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:07:04,454 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:07:04,454 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:07:04,455 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:07:04,455 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:07:04,455 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:07:04,456 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:07:04,565 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:07:04,791 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,791 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,815 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,816 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,820 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,821 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,844 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,845 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,846 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,846 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,846 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,847 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,847 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,881 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:07:04,912 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:07:04,930 WARN L230 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_hash_table_clean_up_harness.i[4497,4510] [2021-11-16 21:07:04,930 WARN L230 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_hash_table_clean_up_harness.i[4557,4570] [2021-11-16 21:07:04,931 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:07:04,932 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:07:04,964 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,964 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,964 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,964 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,965 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,970 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,971 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,972 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,972 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,972 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,973 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,973 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,973 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:04,991 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:07:04,992 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:07:04,992 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:07:04,992 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:07:04,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:07:04,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:07:04,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:07:04,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:07:04,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:07:04,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:07:05,015 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:07:05,105 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,105 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,110 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,110 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,112 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,112 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,126 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,126 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,126 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,127 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,127 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,127 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,128 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:07:05,138 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:07:05,276 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:07:05,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05 WrapperNode [2021-11-16 21:07:05,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:07:05,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:07:05,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:07:05,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:07:05,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,445 INFO L137 Inliner]: procedures = 777, calls = 2447, calls flagged for inlining = 71, calls inlined = 16, statements flattened = 718 [2021-11-16 21:07:05,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:07:05,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:07:05,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:07:05,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:07:05,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:07:05,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:07:05,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:07:05,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:07:05,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (1/1) ... [2021-11-16 21:07:05,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:07:05,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:07:05,555 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-16 21:07:05,575 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-16 21:07:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2021-11-16 21:07:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2021-11-16 21:07:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-16 21:07:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:07:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:07:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 21:07:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:07:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:07:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:07:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:07:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2021-11-16 21:07:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2021-11-16 21:07:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:07:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:07:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:07:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:07:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:07:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:07:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:07:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:07:05,583 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:07:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-16 21:07:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2021-11-16 21:07:05,583 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2021-11-16 21:07:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:07:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2021-11-16 21:07:05,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2021-11-16 21:07:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:07:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:07:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 21:07:05,584 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 21:07:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 21:07:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2021-11-16 21:07:05,584 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2021-11-16 21:07:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2021-11-16 21:07:05,584 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2021-11-16 21:07:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:07:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2021-11-16 21:07:05,585 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2021-11-16 21:07:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-16 21:07:05,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-16 21:07:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:07:05,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:07:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2021-11-16 21:07:05,585 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2021-11-16 21:07:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:07:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:07:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:07:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:07:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:07:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2021-11-16 21:07:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2021-11-16 21:07:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:07:05,818 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:07:05,819 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:07:06,732 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:07:06,742 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:07:06,742 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-16 21:07:06,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:07:06 BoogieIcfgContainer [2021-11-16 21:07:06,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:07:06,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:07:06,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:07:06,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:07:06,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:07:03" (1/3) ... [2021-11-16 21:07:06,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6684530d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:07:06, skipping insertion in model container [2021-11-16 21:07:06,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:07:05" (2/3) ... [2021-11-16 21:07:06,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6684530d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:07:06, skipping insertion in model container [2021-11-16 21:07:06,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:07:06" (3/3) ... [2021-11-16 21:07:06,750 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2021-11-16 21:07:06,753 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:07:06,753 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:07:06,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:07:06,803 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-16 21:07:06,803 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:07:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 127 states have internal predecessors, (151), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-11-16 21:07:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-16 21:07:06,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:06,834 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:06,835 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash -623915720, now seen corresponding path program 1 times [2021-11-16 21:07:06,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:06,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715158327] [2021-11-16 21:07:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:06,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:07,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:07,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:07,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715158327] [2021-11-16 21:07:07,237 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2021-11-16 21:07:07,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27059227] [2021-11-16 21:07:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:07,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:07:07,239 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-16 21:07:07,240 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-16 21:07:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:07,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 2221 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 21:07:07,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:07:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-11-16 21:07:07,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:07:07,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27059227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:07,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:07,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-16 21:07:07,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098892485] [2021-11-16 21:07:07,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:07,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 21:07:07,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 21:07:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 21:07:07,862 INFO L87 Difference]: Start difference. First operand has 194 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 127 states have internal predecessors, (151), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:07:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:07,914 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2021-11-16 21:07:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 21:07:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2021-11-16 21:07:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:07,925 INFO L225 Difference]: With dead ends: 383 [2021-11-16 21:07:07,925 INFO L226 Difference]: Without dead ends: 187 [2021-11-16 21:07:07,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 21:07:07,937 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:07,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:07:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-16 21:07:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-11-16 21:07:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 121 states have internal predecessors, (140), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-16 21:07:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 233 transitions. [2021-11-16 21:07:07,977 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 233 transitions. Word has length 134 [2021-11-16 21:07:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:07,977 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 233 transitions. [2021-11-16 21:07:07,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:07:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2021-11-16 21:07:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-16 21:07:07,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:07,983 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:08,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-16 21:07:08,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-11-16 21:07:08,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash -428434944, now seen corresponding path program 1 times [2021-11-16 21:07:08,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:08,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783524699] [2021-11-16 21:07:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:08,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:08,255 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:07:08,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607587707] [2021-11-16 21:07:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:08,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:08,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:07:08,256 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-16 21:07:08,257 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-16 21:07:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:08,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 2221 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:07:08,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:07:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-11-16 21:07:08,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:07:08,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:08,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783524699] [2021-11-16 21:07:08,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:07:08,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607587707] [2021-11-16 21:07:08,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607587707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:08,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:08,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:07:08,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472170113] [2021-11-16 21:07:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:08,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:07:08,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:07:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:07:08,778 INFO L87 Difference]: Start difference. First operand 187 states and 233 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:07:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:08,824 INFO L93 Difference]: Finished difference Result 337 states and 421 transitions. [2021-11-16 21:07:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:07:08,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2021-11-16 21:07:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:08,826 INFO L225 Difference]: With dead ends: 337 [2021-11-16 21:07:08,826 INFO L226 Difference]: Without dead ends: 192 [2021-11-16 21:07:08,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:07:08,828 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 2 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:08,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 916 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:07:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-11-16 21:07:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-11-16 21:07:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 124 states have (on average 1.1612903225806452) internal successors, (144), 125 states have internal predecessors, (144), 47 states have call successors, (47), 19 states have call predecessors, (47), 20 states have return successors, (47), 47 states have call predecessors, (47), 46 states have call successors, (47) [2021-11-16 21:07:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2021-11-16 21:07:08,840 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 134 [2021-11-16 21:07:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:08,840 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2021-11-16 21:07:08,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:07:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2021-11-16 21:07:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-16 21:07:08,842 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:08,842 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:08,861 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-16 21:07:09,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-11-16 21:07:09,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash -447704184, now seen corresponding path program 1 times [2021-11-16 21:07:09,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:09,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123647362] [2021-11-16 21:07:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:09,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:07:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:07:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 21:07:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 21:07:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:07:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:07:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 21:07:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 21:07:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-16 21:07:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-16 21:07:09,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:09,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123647362] [2021-11-16 21:07:09,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123647362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:09,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:09,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 21:07:09,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592013403] [2021-11-16 21:07:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:09,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 21:07:09,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 21:07:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:07:09,512 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 21:07:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:11,401 INFO L93 Difference]: Finished difference Result 348 states and 437 transitions. [2021-11-16 21:07:11,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:07:11,402 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 140 [2021-11-16 21:07:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:11,404 INFO L225 Difference]: With dead ends: 348 [2021-11-16 21:07:11,404 INFO L226 Difference]: Without dead ends: 217 [2021-11-16 21:07:11,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-11-16 21:07:11,405 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 170 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:11,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1066 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-16 21:07:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-16 21:07:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2021-11-16 21:07:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 128 states have (on average 1.1640625) internal successors, (149), 130 states have internal predecessors, (149), 47 states have call successors, (47), 19 states have call predecessors, (47), 21 states have return successors, (50), 47 states have call predecessors, (50), 46 states have call successors, (50) [2021-11-16 21:07:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2021-11-16 21:07:11,417 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 140 [2021-11-16 21:07:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:11,418 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2021-11-16 21:07:11,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 21:07:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2021-11-16 21:07:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-16 21:07:11,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:11,419 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:11,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 21:07:11,419 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1286400266, now seen corresponding path program 1 times [2021-11-16 21:07:11,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:11,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297093685] [2021-11-16 21:07:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:11,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:07:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:07:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 21:07:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 21:07:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:07:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:07:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 21:07:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 21:07:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-16 21:07:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-16 21:07:11,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:11,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297093685] [2021-11-16 21:07:11,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297093685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:11,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:11,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 21:07:11,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134304628] [2021-11-16 21:07:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:11,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:07:11,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:07:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:07:11,736 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:07:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:12,812 INFO L93 Difference]: Finished difference Result 355 states and 449 transitions. [2021-11-16 21:07:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:07:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2021-11-16 21:07:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:12,814 INFO L225 Difference]: With dead ends: 355 [2021-11-16 21:07:12,814 INFO L226 Difference]: Without dead ends: 219 [2021-11-16 21:07:12,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:07:12,815 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 194 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:12,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 730 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 21:07:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-16 21:07:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2021-11-16 21:07:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 129 states have (on average 1.1627906976744187) internal successors, (150), 131 states have internal predecessors, (150), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-16 21:07:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2021-11-16 21:07:12,825 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 140 [2021-11-16 21:07:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:12,826 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2021-11-16 21:07:12,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:07:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2021-11-16 21:07:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-16 21:07:12,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:12,832 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:12,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 21:07:12,833 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:12,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1325960714, now seen corresponding path program 1 times [2021-11-16 21:07:12,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:12,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272344165] [2021-11-16 21:07:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:12,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:07:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 21:07:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 21:07:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:07:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:07:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:07:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 21:07:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 21:07:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 21:07:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-16 21:07:13,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:13,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272344165] [2021-11-16 21:07:13,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272344165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:13,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:13,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 21:07:13,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64533415] [2021-11-16 21:07:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:13,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:07:13,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:07:13,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:07:13,162 INFO L87 Difference]: Start difference. First operand 199 states and 249 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2021-11-16 21:07:15,453 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:16,150 INFO L93 Difference]: Finished difference Result 357 states and 457 transitions. [2021-11-16 21:07:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 21:07:16,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 146 [2021-11-16 21:07:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:16,152 INFO L225 Difference]: With dead ends: 357 [2021-11-16 21:07:16,152 INFO L226 Difference]: Without dead ends: 217 [2021-11-16 21:07:16,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:07:16,153 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 149 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:16,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 1046 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 612 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2021-11-16 21:07:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-16 21:07:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2021-11-16 21:07:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 131 states have internal predecessors, (149), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-16 21:07:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2021-11-16 21:07:16,162 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 146 [2021-11-16 21:07:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:16,163 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2021-11-16 21:07:16,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2021-11-16 21:07:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2021-11-16 21:07:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-16 21:07:16,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:16,164 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:16,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 21:07:16,164 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -133220748, now seen corresponding path program 1 times [2021-11-16 21:07:16,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:16,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059057666] [2021-11-16 21:07:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:16,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:16,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:16,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:07:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:07:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:07:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 21:07:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:07:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:07:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:07:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:07:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-11-16 21:07:17,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:17,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059057666] [2021-11-16 21:07:17,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059057666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:17,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:17,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-16 21:07:17,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524223438] [2021-11-16 21:07:17,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:17,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-16 21:07:17,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-16 21:07:17,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-11-16 21:07:17,272 INFO L87 Difference]: Start difference. First operand 199 states and 248 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 13 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (24), 13 states have call predecessors, (24), 12 states have call successors, (24) [2021-11-16 21:07:20,238 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:22,249 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:25,450 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:26,748 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:27,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:29,846 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:32,794 INFO L93 Difference]: Finished difference Result 251 states and 308 transitions. [2021-11-16 21:07:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-16 21:07:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 13 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (24), 13 states have call predecessors, (24), 12 states have call successors, (24) Word has length 151 [2021-11-16 21:07:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:32,796 INFO L225 Difference]: With dead ends: 251 [2021-11-16 21:07:32,796 INFO L226 Difference]: Without dead ends: 229 [2021-11-16 21:07:32,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1237, Unknown=0, NotChecked=0, Total=1406 [2021-11-16 21:07:32,797 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 396 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 273 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:32,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 976 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2635 Invalid, 1 Unknown, 0 Unchecked, 15.2s Time] [2021-11-16 21:07:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-16 21:07:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 199. [2021-11-16 21:07:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 129 states have (on average 1.1472868217054264) internal successors, (148), 131 states have internal predecessors, (148), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-16 21:07:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2021-11-16 21:07:32,812 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 151 [2021-11-16 21:07:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:32,813 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2021-11-16 21:07:32,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 13 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (24), 13 states have call predecessors, (24), 12 states have call successors, (24) [2021-11-16 21:07:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2021-11-16 21:07:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-16 21:07:32,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:32,815 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:32,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 21:07:32,816 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash 442702791, now seen corresponding path program 1 times [2021-11-16 21:07:32,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:32,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091111082] [2021-11-16 21:07:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:32,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:07:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:07:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:07:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 21:07:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:07:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:07:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:07:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:07:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-16 21:07:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-16 21:07:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-11-16 21:07:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2021-11-16 21:07:33,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:33,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091111082] [2021-11-16 21:07:33,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091111082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:33,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:33,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:07:33,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332920321] [2021-11-16 21:07:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:33,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:07:33,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:07:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:07:33,099 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:07:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:35,058 INFO L93 Difference]: Finished difference Result 299 states and 365 transitions. [2021-11-16 21:07:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:07:35,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2021-11-16 21:07:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:35,060 INFO L225 Difference]: With dead ends: 299 [2021-11-16 21:07:35,060 INFO L226 Difference]: Without dead ends: 217 [2021-11-16 21:07:35,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:07:35,060 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 182 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:35,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 511 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-16 21:07:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-16 21:07:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-11-16 21:07:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 130 states have (on average 1.146153846153846) internal successors, (149), 132 states have internal predecessors, (149), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-16 21:07:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2021-11-16 21:07:35,071 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 176 [2021-11-16 21:07:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:35,072 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2021-11-16 21:07:35,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:07:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2021-11-16 21:07:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-16 21:07:35,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:35,075 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:35,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 21:07:35,075 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash -578365563, now seen corresponding path program 1 times [2021-11-16 21:07:35,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:35,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927580261] [2021-11-16 21:07:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:35,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:07:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:07:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:07:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 21:07:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:07:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:07:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:07:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:07:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-16 21:07:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-16 21:07:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-11-16 21:07:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2021-11-16 21:07:35,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:35,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927580261] [2021-11-16 21:07:35,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927580261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:35,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:35,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 21:07:35,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413757827] [2021-11-16 21:07:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:35,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:07:35,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:07:35,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:07:35,376 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:07:39,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:39,681 INFO L93 Difference]: Finished difference Result 323 states and 399 transitions. [2021-11-16 21:07:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:07:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 176 [2021-11-16 21:07:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:39,683 INFO L225 Difference]: With dead ends: 323 [2021-11-16 21:07:39,683 INFO L226 Difference]: Without dead ends: 217 [2021-11-16 21:07:39,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:07:39,684 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 100 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 72 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:39,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 615 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 458 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2021-11-16 21:07:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-16 21:07:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-11-16 21:07:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 130 states have (on average 1.1384615384615384) internal successors, (148), 132 states have internal predecessors, (148), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-16 21:07:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 247 transitions. [2021-11-16 21:07:39,692 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 247 transitions. Word has length 176 [2021-11-16 21:07:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:39,693 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 247 transitions. [2021-11-16 21:07:39,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:07:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 247 transitions. [2021-11-16 21:07:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-11-16 21:07:39,694 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:39,694 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:39,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 21:07:39,695 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash -361857032, now seen corresponding path program 1 times [2021-11-16 21:07:39,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:39,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043990118] [2021-11-16 21:07:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:39,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:07:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:07:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:07:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 21:07:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:07:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:07:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:07:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:07:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-16 21:07:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-16 21:07:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-16 21:07:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-16 21:07:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2021-11-16 21:07:40,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:40,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043990118] [2021-11-16 21:07:40,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043990118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:07:40,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633203141] [2021-11-16 21:07:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:40,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:40,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:07:40,019 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-16 21:07:40,020 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-16 21:07:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:40,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 21:07:40,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:07:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-11-16 21:07:40,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:07:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-11-16 21:07:41,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633203141] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:07:41,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:07:41,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2021-11-16 21:07:41,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053486770] [2021-11-16 21:07:41,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:07:41,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-16 21:07:41,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:41,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-16 21:07:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2021-11-16 21:07:41,278 INFO L87 Difference]: Start difference. First operand 200 states and 247 transitions. Second operand has 24 states, 20 states have (on average 6.45) internal successors, (129), 18 states have internal predecessors, (129), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) [2021-11-16 21:07:42,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:46,416 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:48,206 INFO L93 Difference]: Finished difference Result 334 states and 414 transitions. [2021-11-16 21:07:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-16 21:07:48,207 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 6.45) internal successors, (129), 18 states have internal predecessors, (129), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) Word has length 185 [2021-11-16 21:07:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:48,208 INFO L225 Difference]: With dead ends: 334 [2021-11-16 21:07:48,208 INFO L226 Difference]: Without dead ends: 226 [2021-11-16 21:07:48,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=1690, Unknown=0, NotChecked=0, Total=1980 [2021-11-16 21:07:48,210 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 472 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:48,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1786 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2510 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2021-11-16 21:07:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-16 21:07:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2021-11-16 21:07:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.1343283582089552) internal successors, (152), 138 states have internal predecessors, (152), 48 states have call successors, (48), 19 states have call predecessors, (48), 23 states have return successors, (54), 48 states have call predecessors, (54), 47 states have call successors, (54) [2021-11-16 21:07:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 254 transitions. [2021-11-16 21:07:48,219 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 254 transitions. Word has length 185 [2021-11-16 21:07:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:48,220 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 254 transitions. [2021-11-16 21:07:48,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 6.45) internal successors, (129), 18 states have internal predecessors, (129), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) [2021-11-16 21:07:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 254 transitions. [2021-11-16 21:07:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-11-16 21:07:48,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:48,222 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:48,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-16 21:07:48,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:48,435 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1707074820, now seen corresponding path program 1 times [2021-11-16 21:07:48,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:48,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746462858] [2021-11-16 21:07:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:48,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:07:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:07:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:07:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 21:07:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:07:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:07:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:07:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:07:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-16 21:07:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-16 21:07:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-11-16 21:07:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-16 21:07:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-11-16 21:07:49,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:49,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746462858] [2021-11-16 21:07:49,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746462858] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:07:49,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071353639] [2021-11-16 21:07:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:49,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:07:49,020 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-16 21:07:49,021 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-16 21:07:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:49,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:07:49,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:07:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-11-16 21:07:49,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:07:49,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071353639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:49,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:07:49,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2021-11-16 21:07:49,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540799102] [2021-11-16 21:07:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:49,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:07:49,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:07:49,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:07:49,702 INFO L87 Difference]: Start difference. First operand 206 states and 254 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2021-11-16 21:07:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:49,861 INFO L93 Difference]: Finished difference Result 319 states and 391 transitions. [2021-11-16 21:07:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:07:49,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 196 [2021-11-16 21:07:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:49,863 INFO L225 Difference]: With dead ends: 319 [2021-11-16 21:07:49,863 INFO L226 Difference]: Without dead ends: 206 [2021-11-16 21:07:49,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-11-16 21:07:49,864 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 276 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:49,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 660 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:07:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-16 21:07:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2021-11-16 21:07:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 135 states have internal predecessors, (150), 48 states have call successors, (48), 19 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-16 21:07:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2021-11-16 21:07:49,873 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 196 [2021-11-16 21:07:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:49,874 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2021-11-16 21:07:49,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2021-11-16 21:07:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2021-11-16 21:07:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-11-16 21:07:49,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:49,876 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:49,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-16 21:07:50,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:50,087 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1755111832, now seen corresponding path program 1 times [2021-11-16 21:07:50,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:50,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740323929] [2021-11-16 21:07:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:50,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:07:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:07:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:07:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 21:07:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:07:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:07:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:07:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:07:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-16 21:07:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-16 21:07:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-16 21:07:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-11-16 21:07:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2021-11-16 21:07:50,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:50,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740323929] [2021-11-16 21:07:50,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740323929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:50,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:07:50,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 21:07:50,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520159009] [2021-11-16 21:07:50,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:50,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:07:50,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:50,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:07:50,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:07:50,554 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 11 states, 9 states have (on average 8.333333333333334) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-16 21:07:53,285 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:07:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:53,888 INFO L93 Difference]: Finished difference Result 226 states and 275 transitions. [2021-11-16 21:07:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 21:07:53,888 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.333333333333334) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 207 [2021-11-16 21:07:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:53,890 INFO L225 Difference]: With dead ends: 226 [2021-11-16 21:07:53,890 INFO L226 Difference]: Without dead ends: 224 [2021-11-16 21:07:53,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:07:53,891 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 122 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:53,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 1344 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-16 21:07:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-16 21:07:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2021-11-16 21:07:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 48 states have call successors, (48), 20 states have call predecessors, (48), 23 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-16 21:07:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 252 transitions. [2021-11-16 21:07:53,899 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 252 transitions. Word has length 207 [2021-11-16 21:07:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:53,900 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 252 transitions. [2021-11-16 21:07:53,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.333333333333334) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-16 21:07:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 252 transitions. [2021-11-16 21:07:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-16 21:07:53,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:53,901 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:53,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 21:07:53,902 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:53,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:53,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2124808202, now seen corresponding path program 1 times [2021-11-16 21:07:53,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:53,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473706775] [2021-11-16 21:07:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:53,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:07:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:07:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:07:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:07:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:07:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:07:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:07:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:07:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:07:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:07:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:07:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:07:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 21:07:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:07:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:07:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:07:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:07:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:07:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:07:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-16 21:07:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-16 21:07:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:07:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:07:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-16 21:07:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-11-16 21:07:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-11-16 21:07:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-11-16 21:07:54,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:07:54,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473706775] [2021-11-16 21:07:54,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473706775] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:07:54,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012394324] [2021-11-16 21:07:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:54,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:07:54,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:07:54,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 21:07:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:07:54,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-16 21:07:54,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:07:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-16 21:07:55,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:07:55,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012394324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:07:55,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:07:55,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2021-11-16 21:07:55,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750445032] [2021-11-16 21:07:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:07:55,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:07:55,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:07:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:07:55,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:07:55,137 INFO L87 Difference]: Start difference. First operand 207 states and 252 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-16 21:07:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:07:55,378 INFO L93 Difference]: Finished difference Result 367 states and 448 transitions. [2021-11-16 21:07:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:07:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 213 [2021-11-16 21:07:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:07:55,381 INFO L225 Difference]: With dead ends: 367 [2021-11-16 21:07:55,381 INFO L226 Difference]: Without dead ends: 207 [2021-11-16 21:07:55,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:07:55,382 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 241 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:07:55,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 867 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:07:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-16 21:07:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2021-11-16 21:07:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 131 states have (on average 1.1221374045801527) internal successors, (147), 134 states have internal predecessors, (147), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2021-11-16 21:07:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 245 transitions. [2021-11-16 21:07:55,400 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 245 transitions. Word has length 213 [2021-11-16 21:07:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:07:55,400 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 245 transitions. [2021-11-16 21:07:55,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-16 21:07:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 245 transitions. [2021-11-16 21:07:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-11-16 21:07:55,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:07:55,402 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:07:55,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-16 21:07:55,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-16 21:07:55,615 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:07:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:07:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2025906859, now seen corresponding path program 1 times [2021-11-16 21:07:55,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:07:55,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594646903] [2021-11-16 21:07:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:55,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:07:55,641 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:07:55,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2020152356] [2021-11-16 21:07:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:07:55,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:07:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:07:55,642 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:07:55,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 21:08:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 2623 conjuncts, 394 conjunts are in the unsatisfiable core [2021-11-16 21:08:47,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:08:47,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:08:47,640 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-16 21:08:47,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-16 21:08:47,702 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-16 21:08:47,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 21:08:47,889 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-16 21:08:48,045 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 17 treesize of output 9 [2021-11-16 21:08:48,223 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-16 21:08:48,572 INFO L354 Elim1Store]: treesize reduction 211, result has 10.2 percent of original size [2021-11-16 21:08:48,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 97 [2021-11-16 21:08:49,939 INFO L354 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2021-11-16 21:08:49,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 86 [2021-11-16 21:08:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 148 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-11-16 21:08:51,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:08:53,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:53,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594646903] [2021-11-16 21:08:53,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:08:53,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020152356] [2021-11-16 21:08:53,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020152356] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:08:53,981 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:08:53,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2021-11-16 21:08:53,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780480086] [2021-11-16 21:08:53,981 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-16 21:08:53,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-16 21:08:53,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-16 21:08:53,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2179, Unknown=0, NotChecked=0, Total=2352 [2021-11-16 21:08:53,983 INFO L87 Difference]: Start difference. First operand 202 states and 245 transitions. Second operand has 37 states, 28 states have (on average 3.392857142857143) internal successors, (95), 26 states have internal predecessors, (95), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2021-11-16 21:08:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:54,303 INFO L93 Difference]: Finished difference Result 398 states and 475 transitions. [2021-11-16 21:08:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-16 21:08:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 3.392857142857143) internal successors, (95), 26 states have internal predecessors, (95), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) Word has length 219 [2021-11-16 21:08:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:54,304 INFO L225 Difference]: With dead ends: 398 [2021-11-16 21:08:54,304 INFO L226 Difference]: Without dead ends: 225 [2021-11-16 21:08:54,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=173, Invalid=2179, Unknown=0, NotChecked=0, Total=2352 [2021-11-16 21:08:54,306 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 24 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 922 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:54,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1727 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 922 Unchecked, 0.3s Time] [2021-11-16 21:08:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-16 21:08:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2021-11-16 21:08:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 146 states have (on average 1.1095890410958904) internal successors, (162), 149 states have internal predecessors, (162), 50 states have call successors, (50), 25 states have call predecessors, (50), 27 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2021-11-16 21:08:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 265 transitions. [2021-11-16 21:08:54,328 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 265 transitions. Word has length 219 [2021-11-16 21:08:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:54,328 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 265 transitions. [2021-11-16 21:08:54,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 3.392857142857143) internal successors, (95), 26 states have internal predecessors, (95), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2021-11-16 21:08:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 265 transitions. [2021-11-16 21:08:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-11-16 21:08:54,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:54,330 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:54,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 21:08:54,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:08:54,543 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1719785267, now seen corresponding path program 1 times [2021-11-16 21:08:54,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:54,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767415265] [2021-11-16 21:08:54,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:54,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:08:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:08:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:08:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:08:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:08:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:08:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:08:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:08:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:08:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-16 21:08:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:08:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:08:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:08:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 21:08:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 21:08:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:08:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-16 21:08:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 21:08:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-16 21:08:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-16 21:08:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-16 21:08:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-16 21:08:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:08:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:08:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-16 21:08:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-16 21:08:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:08:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:08:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-16 21:08:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-16 21:08:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2021-11-16 21:08:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2021-11-16 21:08:54,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:54,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767415265] [2021-11-16 21:08:54,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767415265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:08:54,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:08:54,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 21:08:54,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636565020] [2021-11-16 21:08:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:08:54,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:08:54,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:54,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:08:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:08:54,901 INFO L87 Difference]: Start difference. First operand 224 states and 265 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:08:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:55,788 INFO L93 Difference]: Finished difference Result 404 states and 481 transitions. [2021-11-16 21:08:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:08:55,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2021-11-16 21:08:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:55,790 INFO L225 Difference]: With dead ends: 404 [2021-11-16 21:08:55,790 INFO L226 Difference]: Without dead ends: 219 [2021-11-16 21:08:55,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:08:55,791 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 79 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:55,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 1149 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 21:08:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-16 21:08:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 210. [2021-11-16 21:08:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 137 states have (on average 1.102189781021898) internal successors, (151), 140 states have internal predecessors, (151), 47 states have call successors, (47), 23 states have call predecessors, (47), 25 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2021-11-16 21:08:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-11-16 21:08:55,804 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 225 [2021-11-16 21:08:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:55,805 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-11-16 21:08:55,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:08:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-11-16 21:08:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-11-16 21:08:55,806 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:55,806 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:55,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 21:08:55,807 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1638507119, now seen corresponding path program 1 times [2021-11-16 21:08:55,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:55,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097621258] [2021-11-16 21:08:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:55,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:55,829 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:08:55,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141558676] [2021-11-16 21:08:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:55,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:08:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:08:55,831 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:08:55,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 21:08:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:56,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:08:56,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:08:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-11-16 21:08:56,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:08:56,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:56,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097621258] [2021-11-16 21:08:56,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:08:56,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141558676] [2021-11-16 21:08:56,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141558676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:08:56,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:08:56,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 21:08:56,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871701349] [2021-11-16 21:08:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:08:56,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:08:56,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:56,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:08:56,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:08:56,502 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:08:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:56,519 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-11-16 21:08:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:08:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2021-11-16 21:08:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:56,520 INFO L225 Difference]: With dead ends: 210 [2021-11-16 21:08:56,520 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 21:08:56,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:08:56,521 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:56,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 274 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:08:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 21:08:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 21:08:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-16 21:08:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 21:08:56,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2021-11-16 21:08:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:56,522 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 21:08:56,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:08:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 21:08:56,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 21:08:56,524 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 21:08:56,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-16 21:08:56,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:08:56,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 21:08:57,845 INFO L858 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2021-11-16 21:08:57,845 INFO L854 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (forall ((|aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse0 (+ (* 18446744073709551616 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|))) (or (not (<= 0 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|)) (not (<= |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| 8)) (not (<= 0 .cse0)) (= .cse0 0) (not (= (+ (* 442721857769029238784 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) (* 442721857769029238784 |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|) (* 24 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))) (not (< .cse0 18446744073709551616))))) (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,845 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (forall ((|aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse0 (+ (* 18446744073709551616 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|))) (or (not (<= 0 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|)) (not (<= |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| 8)) (not (<= 0 .cse0)) (= .cse0 0) (not (= (+ (* 442721857769029238784 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) (* 442721857769029238784 |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|) (* 24 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))) (not (< .cse0 18446744073709551616))))) (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,845 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2021-11-16 21:08:57,845 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2021-11-16 21:08:57,845 INFO L861 garLoopResultBuilder]: At program point L10017-4(line 10017) the Hoare annotation is: true [2021-11-16 21:08:57,845 INFO L858 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2021-11-16 21:08:57,845 INFO L858 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2021-11-16 21:08:57,845 INFO L858 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L861 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10015 10018) the Hoare annotation is: true [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10015 10018) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10015 10018) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L861 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2021-11-16 21:08:57,846 INFO L861 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L861 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L854 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10128 10140) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L10135-2(lines 10135 10137) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L854 garLoopResultBuilder]: At program point L10131(line 10131) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1) |#valid|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0))) [2021-11-16 21:08:57,846 INFO L858 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2021-11-16 21:08:57,846 INFO L854 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: (or (and (= (* 24 |hash_table_state_required_bytes_#in~size|) |hash_table_state_required_bytes_#t~mem1325|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_13| Int)) (let ((.cse0 (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1))) (and (= (store .cse0 |v___CPROVER_overflow_mult_~#c~1.base_13| 0) |#valid|) (= (select .cse0 |v___CPROVER_overflow_mult_~#c~1.base_13|) 0)))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|)) (not (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10128 10140) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point L10135-1(line 10135) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point L10131-2(lines 10131 10133) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10128 10140) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L861 garLoopResultBuilder]: At program point memset_override_0_implENTRY(lines 7397 7412) the Hoare annotation is: true [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point memset_override_0_implFINAL(lines 7397 7412) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point L7403-1(line 7403) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L861 garLoopResultBuilder]: At program point L7403(line 7403) the Hoare annotation is: true [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L861 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: true [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point memset_override_0_implEXIT(lines 7397 7412) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L861 garLoopResultBuilder]: At program point L7398(line 7398) the Hoare annotation is: true [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point L7400(line 7400) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L861 garLoopResultBuilder]: At program point L7398-1(line 7398) the Hoare annotation is: true [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2021-11-16 21:08:57,847 INFO L854 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,847 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (or (and (exists ((|v___CPROVER_overflow_mult_~#c~1.base_13| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_13|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_13| 0) |#valid|))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= (* |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_#in~b#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|))) (and (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,848 INFO L854 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L854 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (and (exists ((|v___CPROVER_overflow_mult_~#c~1.base_13| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_13|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_13| 0) |#valid|))) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|)) (not (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L861 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L861 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10026 10073) the Hoare annotation is: true [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10026 10073) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10026 10073) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point L10054-1(line 10054) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L861 garLoopResultBuilder]: At program point L10054(line 10054) the Hoare annotation is: true [2021-11-16 21:08:57,848 INFO L861 garLoopResultBuilder]: At program point my_memsetENTRY(lines 7414 7416) the Hoare annotation is: true [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point my_memsetFINAL(lines 7414 7416) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L858 garLoopResultBuilder]: For program point L7415-1(line 7415) no Hoare annotation was computed. [2021-11-16 21:08:57,848 INFO L861 garLoopResultBuilder]: At program point L7415(line 7415) the Hoare annotation is: true [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point my_memsetEXIT(lines 7414 7416) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2021-11-16 21:08:57,849 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2021-11-16 21:08:57,849 INFO L861 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2021-11-16 21:08:57,849 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (or (and (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_13| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_13|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_13| 0) |#valid|)))) (not (< 0 |#StackHeapBarrier|)) (and (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,849 INFO L854 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2021-11-16 21:08:57,849 INFO L854 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (not (= .cse0 0)) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= .cse0 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L9276(lines 9276 9278) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L9276-2(lines 9276 9278) the Hoare annotation is: false [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (.cse1 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|))) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and .cse0 .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse2 .cse3 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) (not (= .cse6 0)) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_13| Int) (|v_hash_table_state_required_bytes_~#elemsize~0.base_15| Int)) (and (= (select |#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_15|) 0) (= (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_13|) 0) (not (= |v_hash_table_state_required_bytes_~#elemsize~0.base_15| |v___CPROVER_overflow_mult_~#c~1.base_13|)))) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= .cse6 8) .cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 0) .cse5)))) [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L9276-3(lines 9276 9278) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L9945(line 9945) the Hoare annotation is: false [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L9945-1(line 9945) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L7179-1(line 7179) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L7179(line 7179) the Hoare annotation is: false [2021-11-16 21:08:57,850 INFO L858 garLoopResultBuilder]: For program point L9285(lines 9285 9287) no Hoare annotation was computed. [2021-11-16 21:08:57,850 INFO L854 garLoopResultBuilder]: At program point L9954(line 9954) the Hoare annotation is: false [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L854 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 0)) (.cse1 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ .cse0 29629528)) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= .cse0 |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (not (= .cse1 0)) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_13| Int) (|v_hash_table_state_required_bytes_~#elemsize~0.base_15| Int)) (and (= (select |#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_15|) 0) (= (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_13|) 0) (not (= |v_hash_table_state_required_bytes_~#elemsize~0.base_15| |v___CPROVER_overflow_mult_~#c~1.base_13|)))) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= .cse1 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L9954-1(line 9954) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L854 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-11-16 21:08:57,851 INFO L861 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: true [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L7180-1(line 7180) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L854 garLoopResultBuilder]: At program point L7180(line 7180) the Hoare annotation is: false [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L6825-3(lines 6825 6827) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L6825-1(lines 6825 6827) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L854 garLoopResultBuilder]: At program point L6825(line 6825) the Hoare annotation is: false [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L9278-1(line 9278) no Hoare annotation was computed. [2021-11-16 21:08:57,851 INFO L858 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L10145(line 10145) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L10145-1(line 10145) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L10145-2(line 10145) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L9278(line 9278) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L10154(line 10154) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L9295(lines 9295 9297) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L9295-1(lines 9295 9297) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L7181(line 7181) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L10154-1(line 10154) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L9948(line 9948) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L9948-1(line 9948) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L9957(line 9957) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L9957-1(line 9957) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L854 garLoopResultBuilder]: At program point L10147(line 10147) the Hoare annotation is: false [2021-11-16 21:08:57,852 INFO L858 garLoopResultBuilder]: For program point L9957-2(line 9957) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L10147-1(line 10147) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L9272(lines 9272 9298) the Hoare annotation is: false [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L10156(lines 10156 10158) the Hoare annotation is: false [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L10156-1(lines 10156 10158) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L7175(lines 7175 7183) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret549#1| 1) (not (= .cse0 0))) (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret549#1| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (<= .cse0 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L9273(lines 9273 9275) the Hoare annotation is: false [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L9273-1(lines 9273 9275) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L9934-1(line 9934) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))) (and (< 1 |ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) (not (= .cse0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_clear_#t~ret1248#1| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= .cse0 0)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_clean_up_~state~4#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_~map#1.offset|) 0)) (< 0 |#StackHeapBarrier|))) [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L9934-2(line 9934) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L9290(line 9290) the Hoare annotation is: false [2021-11-16 21:08:57,853 INFO L854 garLoopResultBuilder]: At program point L9934(line 9934) the Hoare annotation is: false [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L9290-1(line 9290) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2021-11-16 21:08:57,853 INFO L858 garLoopResultBuilder]: For program point L10141(lines 10141 10160) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L7185(lines 7185 7187) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L854 garLoopResultBuilder]: At program point L6822(line 6822) the Hoare annotation is: false [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L6822-3(lines 6822 6824) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L6822-1(lines 6822 6824) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L854 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:08:57,854 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-16 21:08:57,856 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:57,857 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:08:57,864 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,864 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,866 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,866 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:57,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:08:57 BoogieIcfgContainer [2021-11-16 21:08:57,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:08:57,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:08:57,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:08:57,872 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:08:57,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:07:06" (3/4) ... [2021-11-16 21:08:57,874 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_override_0_impl [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2021-11-16 21:08:57,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2021-11-16 21:08:57,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2021-11-16 21:08:57,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2021-11-16 21:08:57,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-11-16 21:08:57,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2021-11-16 21:08:57,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-16 21:08:57,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2021-11-16 21:08:57,893 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 163 nodes and edges [2021-11-16 21:08:57,894 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2021-11-16 21:08:57,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-11-16 21:08:57,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-16 21:08:57,896 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-16 21:08:57,897 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-16 21:08:57,897 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-16 21:08:57,898 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 21:08:57,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v___CPROVER_overflow_mult_~#c~1.base_13 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13 := 0] == \valid) && tl_last_error == \old(tl_last_error)) && \old(a) * \old(b) == unknown-#memory_int-unknown[r][r]) || (\result + 1 <= 0 && \old(\valid) == \valid)) || !(0 < unknown-#StackHeapBarrier-unknown) [2021-11-16 21:08:57,917 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v___CPROVER_overflow_mult_~#c~1.base_13 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13 := 0] == \valid)) || !(0 < unknown-#StackHeapBarrier-unknown)) || (\result + 1 <= 0 && \old(\valid) == \valid) [2021-11-16 21:08:58,370 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 21:08:58,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:08:58,371 INFO L158 Benchmark]: Toolchain (without parser) took 115118.36ms. Allocated memory was 121.6MB in the beginning and 293.6MB in the end (delta: 172.0MB). Free memory was 85.2MB in the beginning and 71.4MB in the end (delta: 13.7MB). Peak memory consumption was 224.5MB. Max. memory is 16.1GB. [2021-11-16 21:08:58,371 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:08:58,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2024.24ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 84.9MB in the beginning and 91.2MB in the end (delta: -6.3MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2021-11-16 21:08:58,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 173.35ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 79.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-16 21:08:58,372 INFO L158 Benchmark]: Boogie Preprocessor took 80.03ms. Allocated memory is still 146.8MB. Free memory was 79.4MB in the beginning and 72.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 21:08:58,373 INFO L158 Benchmark]: RCFGBuilder took 1211.21ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 72.3MB in the beginning and 134.1MB in the end (delta: -61.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2021-11-16 21:08:58,374 INFO L158 Benchmark]: TraceAbstraction took 111126.47ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 133.0MB in the beginning and 144.1MB in the end (delta: -11.1MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2021-11-16 21:08:58,375 INFO L158 Benchmark]: Witness Printer took 497.87ms. Allocated memory is still 293.6MB. Free memory was 144.1MB in the beginning and 71.4MB in the end (delta: 72.6MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2021-11-16 21:08:58,377 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.17ms. Allocated memory is still 121.6MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2024.24ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 84.9MB in the beginning and 91.2MB in the end (delta: -6.3MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 173.35ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 79.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.03ms. Allocated memory is still 146.8MB. Free memory was 79.4MB in the beginning and 72.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1211.21ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 72.3MB in the beginning and 134.1MB in the end (delta: -61.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * TraceAbstraction took 111126.47ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 133.0MB in the beginning and 144.1MB in the end (delta: -11.1MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. * Witness Printer took 497.87ms. Allocated memory is still 293.6MB. Free memory was 144.1MB in the beginning and 71.4MB in the end (delta: 72.6MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 194 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 111.1s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2533 SdHoareTripleChecker+Valid, 38.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2409 mSDsluCounter, 13908 SdHoareTripleChecker+Invalid, 35.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 922 IncrementalHoareTripleChecker+Unchecked, 11063 mSDsCounter, 1497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9666 IncrementalHoareTripleChecker+Invalid, 12089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1497 mSolverCounterUnsat, 2845 mSDtfsCounter, 9666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2310 GetRequests, 2048 SyntacticMatches, 6 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=13, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 177 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 75 LocationsWithAnnotation, 648 PreInvPairs, 679 NumberOfFragments, 985 HoareAnnotationTreeSize, 648 FomulaSimplifications, 1250 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 75 FomulaSimplificationsInter, 1942 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 53.6s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 3395 NumberOfCodeBlocks, 3395 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3427 ConstructedInterpolants, 50 QuantifiedInterpolants, 8732 SizeOfPredicates, 62 NumberOfNonLiveVariables, 17147 ConjunctsInSsa, 461 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 5114/5185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7407]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-16 21:08:58,387 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:58,387 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:58,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:58,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] Derived loop invariant: ((((\exists v___CPROVER_overflow_mult_~#c~1.base_13 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13 := 0] == \valid) && tl_last_error == \old(tl_last_error)) && \old(a) * \old(b) == unknown-#memory_int-unknown[r][r]) || (\result + 1 <= 0 && \old(\valid) == \valid)) || !(0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 2541]: Loop Invariant [2021-11-16 21:08:58,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:58,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:58,389 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] [2021-11-16 21:08:58,389 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_13,QUANTIFIED] Derived loop invariant: ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v___CPROVER_overflow_mult_~#c~1.base_13 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_13 := 0] == \valid)) || !(0 < unknown-#StackHeapBarrier-unknown)) || (\result + 1 <= 0 && \old(\valid) == \valid) - InvariantResult [Line: 10161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-16 21:08:58,438 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE