./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_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 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:50:15,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:50:15,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:50:15,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:50:15,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:50:15,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:50:15,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:50:15,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:50:15,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:50:15,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:50:15,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:50:15,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:50:15,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:50:15,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:50:15,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:50:15,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:50:15,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:50:15,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:50:15,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:50:15,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:50:15,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:50:15,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:50:15,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:50:15,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:50:15,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:50:15,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:50:15,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:50:15,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:50:15,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:50:15,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:50:15,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:50:15,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:50:15,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:50:15,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:50:15,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:50:15,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:50:15,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:50:15,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:50:15,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:50:15,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:50:15,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:50:15,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 00:50:15,460 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:50:15,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:50:15,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:50:15,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:50:15,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:50:15,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:50:15,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:50:15,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:50:15,463 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:50:15,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:50:15,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 00:50:15,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:50:15,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:50:15,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:50:15,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:50:15,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:50:15,466 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:50:15,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:50:15,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:50:15,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:50:15,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:50:15,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:50:15,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:50:15,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:50:15,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:50:15,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 00:50:15,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 00:50:15,468 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:50:15,468 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:50:15,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:50:15,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:50:15,469 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 -> 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d [2021-12-18 00:50:15,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:50:15,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:50:15,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:50:15,757 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:50:15,757 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:50:15,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2021-12-18 00:50:15,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f68e950/e34fc4864fc647048cf74635dab2227b/FLAG0183ae1b9 [2021-12-18 00:50:16,432 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:50:16,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2021-12-18 00:50:16,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f68e950/e34fc4864fc647048cf74635dab2227b/FLAG0183ae1b9 [2021-12-18 00:50:16,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f68e950/e34fc4864fc647048cf74635dab2227b [2021-12-18 00:50:16,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:50:16,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:50:16,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:50:16,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:50:16,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:50:16,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:50:16" (1/1) ... [2021-12-18 00:50:16,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae99f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:16, skipping insertion in model container [2021-12-18 00:50:16,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:50:16" (1/1) ... [2021-12-18 00:50:16,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:50:16,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:50:16,932 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_linked_list_init_harness.i[4494,4507] [2021-12-18 00:50:16,938 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_linked_list_init_harness.i[4554,4567] [2021-12-18 00:50:17,494 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,497 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,498 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,498 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,502 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,513 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,514 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,516 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,516 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,518 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,519 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:17,729 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:50:17,731 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:50:17,732 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:50:17,740 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:50:17,742 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:50:17,744 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:50:17,744 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:50:17,745 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:50:17,746 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:50:17,747 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:50:17,868 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:50:17,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:50:17,914 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:50:17,939 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_linked_list_init_harness.i[4494,4507] [2021-12-18 00:50:17,939 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_linked_list_init_harness.i[4554,4567] [2021-12-18 00:50:18,006 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,007 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,008 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,008 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,009 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,014 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,019 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,020 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,021 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,023 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,023 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,024 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,024 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:50:18,055 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:50:18,056 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:50:18,056 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:50:18,057 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:50:18,058 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:50:18,058 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:50:18,058 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:50:18,059 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:50:18,059 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:50:18,060 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:50:18,077 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:50:18,090 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:50:18,247 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:50:18,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18 WrapperNode [2021-12-18 00:50:18,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:50:18,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:50:18,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:50:18,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:50:18,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,386 INFO L137 Inliner]: procedures = 679, calls = 1036, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2021-12-18 00:50:18,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:50:18,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:50:18,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:50:18,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:50:18,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:50:18,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:50:18,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:50:18,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:50:18,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (1/1) ... [2021-12-18 00:50:18,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:50:18,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:50:18,481 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-12-18 00:50:18,505 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-12-18 00:50:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2021-12-18 00:50:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2021-12-18 00:50:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 00:50:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:50:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:50:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2021-12-18 00:50:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2021-12-18 00:50:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2021-12-18 00:50:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2021-12-18 00:50:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:50:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 00:50:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:50:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:50:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2021-12-18 00:50:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2021-12-18 00:50:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:50:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:50:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 00:50:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 00:50:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:50:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 00:50:18,713 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:50:18,715 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:50:18,901 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:50:18,907 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:50:18,910 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-18 00:50:18,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:50:18 BoogieIcfgContainer [2021-12-18 00:50:18,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:50:18,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:50:18,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:50:18,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:50:18,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:50:16" (1/3) ... [2021-12-18 00:50:18,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4529d0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:50:18, skipping insertion in model container [2021-12-18 00:50:18,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:18" (2/3) ... [2021-12-18 00:50:18,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4529d0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:50:18, skipping insertion in model container [2021-12-18 00:50:18,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:50:18" (3/3) ... [2021-12-18 00:50:18,925 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2021-12-18 00:50:18,929 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:50:18,930 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:50:18,985 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:50:18,989 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-12-18 00:50:18,990 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:50:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-18 00:50:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 00:50:19,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:19,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:19,010 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2021-12-18 00:50:19,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:19,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828666904] [2021-12-18 00:50:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:19,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:19,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:19,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828666904] [2021-12-18 00:50:19,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828666904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:19,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:19,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 00:50:19,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220577346] [2021-12-18 00:50:19,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:19,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 00:50:19,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:19,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 00:50:19,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 00:50:19,488 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:19,509 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2021-12-18 00:50:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 00:50:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-12-18 00:50:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:19,520 INFO L225 Difference]: With dead ends: 117 [2021-12-18 00:50:19,520 INFO L226 Difference]: Without dead ends: 56 [2021-12-18 00:50:19,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 00:50:19,533 INFO L933 BasicCegarLoop]: 75 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, 75 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-12-18 00:50:19,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:50:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-18 00:50:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-18 00:50:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-18 00:50:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-12-18 00:50:19,586 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2021-12-18 00:50:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:19,586 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-12-18 00:50:19,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2021-12-18 00:50:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 00:50:19,590 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:19,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:19,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 00:50:19,591 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2021-12-18 00:50:19,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:19,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805842478] [2021-12-18 00:50:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:19,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:19,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:19,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805842478] [2021-12-18 00:50:19,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805842478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:19,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:19,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:50:19,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122506478] [2021-12-18 00:50:19,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:19,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:50:19,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:19,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:50:19,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:50:19,978 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:20,216 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2021-12-18 00:50:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:50:20,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-12-18 00:50:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:20,222 INFO L225 Difference]: With dead ends: 108 [2021-12-18 00:50:20,222 INFO L226 Difference]: Without dead ends: 59 [2021-12-18 00:50:20,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:50:20,224 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:20,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 342 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-18 00:50:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-18 00:50:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-12-18 00:50:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2021-12-18 00:50:20,239 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2021-12-18 00:50:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:20,239 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2021-12-18 00:50:20,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2021-12-18 00:50:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 00:50:20,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:20,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:20,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 00:50:20,241 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1650638505, now seen corresponding path program 1 times [2021-12-18 00:50:20,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:20,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379401208] [2021-12-18 00:50:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:20,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:20,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:20,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:20,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379401208] [2021-12-18 00:50:20,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379401208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:20,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:20,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 00:50:20,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998311207] [2021-12-18 00:50:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:20,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 00:50:20,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 00:50:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 00:50:20,440 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:20,640 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2021-12-18 00:50:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:50:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-12-18 00:50:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:20,641 INFO L225 Difference]: With dead ends: 124 [2021-12-18 00:50:20,641 INFO L226 Difference]: Without dead ends: 72 [2021-12-18 00:50:20,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:50:20,643 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 77 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:20,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 433 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-18 00:50:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-12-18 00:50:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 52 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2021-12-18 00:50:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2021-12-18 00:50:20,651 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 26 [2021-12-18 00:50:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:20,651 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-12-18 00:50:20,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2021-12-18 00:50:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 00:50:20,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:20,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:20,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 00:50:20,653 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:20,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1257611495, now seen corresponding path program 1 times [2021-12-18 00:50:20,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:20,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91321238] [2021-12-18 00:50:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:20,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:20,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:20,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91321238] [2021-12-18 00:50:20,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91321238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:20,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:20,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 00:50:20,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864941865] [2021-12-18 00:50:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:20,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 00:50:20,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 00:50:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-18 00:50:20,853 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:21,067 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2021-12-18 00:50:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:50:21,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-12-18 00:50:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:21,069 INFO L225 Difference]: With dead ends: 152 [2021-12-18 00:50:21,069 INFO L226 Difference]: Without dead ends: 90 [2021-12-18 00:50:21,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:50:21,071 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 87 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:21,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 396 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-18 00:50:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2021-12-18 00:50:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2021-12-18 00:50:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2021-12-18 00:50:21,079 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 26 [2021-12-18 00:50:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:21,080 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2021-12-18 00:50:21,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2021-12-18 00:50:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 00:50:21,081 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:21,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:21,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 00:50:21,081 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1515776933, now seen corresponding path program 1 times [2021-12-18 00:50:21,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:21,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945312989] [2021-12-18 00:50:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:21,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:21,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:21,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945312989] [2021-12-18 00:50:21,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945312989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:21,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:21,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 00:50:21,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213508970] [2021-12-18 00:50:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:21,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 00:50:21,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 00:50:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 00:50:21,207 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:21,409 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2021-12-18 00:50:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:50:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-12-18 00:50:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:21,413 INFO L225 Difference]: With dead ends: 176 [2021-12-18 00:50:21,413 INFO L226 Difference]: Without dead ends: 110 [2021-12-18 00:50:21,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:50:21,417 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:21,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 506 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-18 00:50:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2021-12-18 00:50:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.396551724137931) internal successors, (81), 60 states have internal predecessors, (81), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2021-12-18 00:50:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2021-12-18 00:50:21,431 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 26 [2021-12-18 00:50:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:21,431 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2021-12-18 00:50:21,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 00:50:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2021-12-18 00:50:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 00:50:21,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:21,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:21,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 00:50:21,433 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:21,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 504659683, now seen corresponding path program 1 times [2021-12-18 00:50:21,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288871585] [2021-12-18 00:50:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:21,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:21,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:21,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288871585] [2021-12-18 00:50:21,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288871585] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:21,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:21,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 00:50:21,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283419987] [2021-12-18 00:50:21,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:21,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:50:21,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:21,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:50:21,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:50:21,519 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:21,566 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2021-12-18 00:50:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:50:21,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-12-18 00:50:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:21,567 INFO L225 Difference]: With dead ends: 173 [2021-12-18 00:50:21,568 INFO L226 Difference]: Without dead ends: 70 [2021-12-18 00:50:21,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:50:21,569 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 45 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:21,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 397 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:50:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-18 00:50:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-18 00:50:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 53 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2021-12-18 00:50:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2021-12-18 00:50:21,576 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 26 [2021-12-18 00:50:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:21,576 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2021-12-18 00:50:21,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2021-12-18 00:50:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 00:50:21,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:21,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:21,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 00:50:21,578 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:21,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2021-12-18 00:50:21,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:21,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74619782] [2021-12-18 00:50:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:21,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:21,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:21,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74619782] [2021-12-18 00:50:21,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74619782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:21,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:21,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:50:21,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088037486] [2021-12-18 00:50:21,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:21,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:50:21,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:50:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:50:21,670 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:21,766 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2021-12-18 00:50:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:50:21,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-12-18 00:50:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:21,768 INFO L225 Difference]: With dead ends: 141 [2021-12-18 00:50:21,768 INFO L226 Difference]: Without dead ends: 72 [2021-12-18 00:50:21,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:50:21,769 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 38 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:21,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 342 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-18 00:50:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-12-18 00:50:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 53 states have internal predecessors, (67), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2021-12-18 00:50:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2021-12-18 00:50:21,782 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 28 [2021-12-18 00:50:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:21,783 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2021-12-18 00:50:21,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2021-12-18 00:50:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 00:50:21,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:21,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:21,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 00:50:21,787 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2021-12-18 00:50:21,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:21,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130046161] [2021-12-18 00:50:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:21,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:21,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:21,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130046161] [2021-12-18 00:50:21,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130046161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:21,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:21,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:50:21,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721955389] [2021-12-18 00:50:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:21,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:50:21,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:21,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:50:21,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:50:21,949 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:22,095 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2021-12-18 00:50:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:50:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 00:50:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:22,097 INFO L225 Difference]: With dead ends: 159 [2021-12-18 00:50:22,097 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 00:50:22,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:50:22,098 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 64 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:22,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 381 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 00:50:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2021-12-18 00:50:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 55 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2021-12-18 00:50:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2021-12-18 00:50:22,105 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 30 [2021-12-18 00:50:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:22,106 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2021-12-18 00:50:22,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2021-12-18 00:50:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-18 00:50:22,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:22,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:22,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 00:50:22,108 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2021-12-18 00:50:22,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:22,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062607064] [2021-12-18 00:50:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:22,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:22,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062607064] [2021-12-18 00:50:22,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062607064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:22,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:22,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 00:50:22,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556541339] [2021-12-18 00:50:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:22,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:50:22,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:50:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:50:22,196 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:22,236 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2021-12-18 00:50:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:50:22,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2021-12-18 00:50:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:22,237 INFO L225 Difference]: With dead ends: 149 [2021-12-18 00:50:22,237 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 00:50:22,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:50:22,238 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:22,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 299 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:50:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 00:50:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2021-12-18 00:50:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.290909090909091) internal successors, (71), 57 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2021-12-18 00:50:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2021-12-18 00:50:22,244 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 31 [2021-12-18 00:50:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:22,245 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2021-12-18 00:50:22,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 00:50:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2021-12-18 00:50:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 00:50:22,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:22,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:22,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 00:50:22,246 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1854431003, now seen corresponding path program 1 times [2021-12-18 00:50:22,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230643125] [2021-12-18 00:50:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:22,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:22,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:22,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230643125] [2021-12-18 00:50:22,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230643125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:22,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:22,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 00:50:22,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824103466] [2021-12-18 00:50:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:22,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 00:50:22,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:22,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 00:50:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:50:22,657 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 00:50:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:23,181 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2021-12-18 00:50:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 00:50:23,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2021-12-18 00:50:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:23,183 INFO L225 Difference]: With dead ends: 164 [2021-12-18 00:50:23,183 INFO L226 Difference]: Without dead ends: 97 [2021-12-18 00:50:23,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-18 00:50:23,184 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 59 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:23,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 532 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 00:50:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-18 00:50:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2021-12-18 00:50:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2021-12-18 00:50:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2021-12-18 00:50:23,191 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 39 [2021-12-18 00:50:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:23,192 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2021-12-18 00:50:23,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 00:50:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2021-12-18 00:50:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 00:50:23,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:23,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:23,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 00:50:23,193 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1596265565, now seen corresponding path program 1 times [2021-12-18 00:50:23,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:23,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740402156] [2021-12-18 00:50:23,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:23,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:23,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:23,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740402156] [2021-12-18 00:50:23,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740402156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:23,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:23,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 00:50:23,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502785778] [2021-12-18 00:50:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:23,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:50:23,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:23,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:50:23,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:50:23,439 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 00:50:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:23,815 INFO L93 Difference]: Finished difference Result 182 states and 246 transitions. [2021-12-18 00:50:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 00:50:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2021-12-18 00:50:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:23,817 INFO L225 Difference]: With dead ends: 182 [2021-12-18 00:50:23,817 INFO L226 Difference]: Without dead ends: 110 [2021-12-18 00:50:23,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-12-18 00:50:23,818 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 106 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:23,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 540 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:50:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-18 00:50:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2021-12-18 00:50:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 73 states have internal predecessors, (88), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2021-12-18 00:50:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2021-12-18 00:50:23,827 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 39 [2021-12-18 00:50:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:23,827 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2021-12-18 00:50:23,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 00:50:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2021-12-18 00:50:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 00:50:23,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:23,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:23,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 00:50:23,828 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1687584481, now seen corresponding path program 1 times [2021-12-18 00:50:23,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:23,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348308755] [2021-12-18 00:50:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:23,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:23,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:23,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348308755] [2021-12-18 00:50:23,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348308755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:23,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:23,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:50:23,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092140322] [2021-12-18 00:50:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:23,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:50:23,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:50:23,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:50:23,960 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 00:50:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:24,156 INFO L93 Difference]: Finished difference Result 215 states and 299 transitions. [2021-12-18 00:50:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:50:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2021-12-18 00:50:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:24,157 INFO L225 Difference]: With dead ends: 215 [2021-12-18 00:50:24,157 INFO L226 Difference]: Without dead ends: 106 [2021-12-18 00:50:24,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:50:24,158 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 59 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:24,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 563 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-18 00:50:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2021-12-18 00:50:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 74 states have internal predecessors, (88), 14 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2021-12-18 00:50:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2021-12-18 00:50:24,167 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 39 [2021-12-18 00:50:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:24,167 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2021-12-18 00:50:24,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 00:50:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-12-18 00:50:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 00:50:24,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:24,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:24,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 00:50:24,168 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1045188466, now seen corresponding path program 1 times [2021-12-18 00:50:24,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:24,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315575128] [2021-12-18 00:50:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:24,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:24,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:24,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315575128] [2021-12-18 00:50:24,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315575128] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:50:24,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025195971] [2021-12-18 00:50:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:24,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:50:24,351 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-12-18 00:50:24,382 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-12-18 00:50:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:24,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 00:50:24,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:50:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:24,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:50:25,249 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 00:50:25,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2021-12-18 00:50:25,258 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-18 00:50:25,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2021-12-18 00:50:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:25,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025195971] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 00:50:25,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:50:25,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11] total 23 [2021-12-18 00:50:25,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109447367] [2021-12-18 00:50:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:25,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:50:25,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:25,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:50:25,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2021-12-18 00:50:25,307 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 00:50:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:25,468 INFO L93 Difference]: Finished difference Result 198 states and 264 transitions. [2021-12-18 00:50:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:50:25,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2021-12-18 00:50:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:25,470 INFO L225 Difference]: With dead ends: 198 [2021-12-18 00:50:25,470 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 00:50:25,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-12-18 00:50:25,471 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 27 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:25,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 330 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 00:50:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2021-12-18 00:50:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 79 states have internal predecessors, (96), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) [2021-12-18 00:50:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2021-12-18 00:50:25,481 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 131 transitions. Word has length 41 [2021-12-18 00:50:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:25,481 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 131 transitions. [2021-12-18 00:50:25,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 00:50:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 131 transitions. [2021-12-18 00:50:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 00:50:25,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:25,482 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 00:50:25,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 00:50:25,699 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,SelfDestructingSolverStorable12 [2021-12-18 00:50:25,700 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2021-12-18 00:50:25,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:25,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307034157] [2021-12-18 00:50:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:25,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:25,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 00:50:25,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:25,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307034157] [2021-12-18 00:50:25,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307034157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:25,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:25,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:50:25,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638284066] [2021-12-18 00:50:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:25,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:50:25,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:50:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:50:25,812 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 00:50:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:25,862 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2021-12-18 00:50:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:50:25,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-12-18 00:50:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:25,863 INFO L225 Difference]: With dead ends: 115 [2021-12-18 00:50:25,863 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 00:50:25,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:50:25,864 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:25,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 459 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:50:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 00:50:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2021-12-18 00:50:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.275) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2021-12-18 00:50:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2021-12-18 00:50:25,893 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 42 [2021-12-18 00:50:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:25,894 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2021-12-18 00:50:25,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-18 00:50:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2021-12-18 00:50:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 00:50:25,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:25,895 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 00:50:25,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 00:50:25,896 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1440497479, now seen corresponding path program 1 times [2021-12-18 00:50:25,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:25,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797085715] [2021-12-18 00:50:25,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:25,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:26,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:26,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 00:50:26,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797085715] [2021-12-18 00:50:26,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797085715] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:50:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412237429] [2021-12-18 00:50:26,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:26,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:26,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:50:26,141 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-12-18 00:50:26,171 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-12-18 00:50:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:26,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 00:50:26,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:50:26,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2021-12-18 00:50:26,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:50:26,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2021-12-18 00:50:48,946 WARN L227 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:50:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 00:50:49,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:50:49,656 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 25 treesize of output 23 [2021-12-18 00:50:49,666 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 29 treesize of output 27 [2021-12-18 00:50:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 00:50:49,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412237429] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:50:49,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:50:49,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 24 [2021-12-18 00:50:49,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834546768] [2021-12-18 00:50:49,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:50:49,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-18 00:50:49,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-18 00:50:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=459, Unknown=6, NotChecked=0, Total=552 [2021-12-18 00:50:49,696 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand has 24 states, 20 states have (on average 4.15) internal successors, (83), 23 states have internal predecessors, (83), 12 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-18 00:50:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:49,941 INFO L93 Difference]: Finished difference Result 307 states and 402 transitions. [2021-12-18 00:50:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 00:50:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 23 states have internal predecessors, (83), 12 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Word has length 50 [2021-12-18 00:50:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:49,943 INFO L225 Difference]: With dead ends: 307 [2021-12-18 00:50:49,943 INFO L226 Difference]: Without dead ends: 178 [2021-12-18 00:50:49,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=101, Invalid=543, Unknown=6, NotChecked=0, Total=650 [2021-12-18 00:50:49,945 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 93 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:49,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 813 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 186 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2021-12-18 00:50:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-18 00:50:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 143. [2021-12-18 00:50:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 116 states have internal predecessors, (136), 17 states have call successors, (17), 10 states have call predecessors, (17), 15 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2021-12-18 00:50:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 180 transitions. [2021-12-18 00:50:49,956 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 180 transitions. Word has length 50 [2021-12-18 00:50:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:49,957 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 180 transitions. [2021-12-18 00:50:49,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 23 states have internal predecessors, (83), 12 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-18 00:50:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 180 transitions. [2021-12-18 00:50:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 00:50:49,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:49,958 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 00:50:49,986 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-12-18 00:50:50,175 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,SelfDestructingSolverStorable14 [2021-12-18 00:50:50,176 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1069445266, now seen corresponding path program 1 times [2021-12-18 00:50:50,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:50,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116926415] [2021-12-18 00:50:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:50,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 00:50:50,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:50,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116926415] [2021-12-18 00:50:50,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116926415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:50,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:50,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 00:50:50,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685988965] [2021-12-18 00:50:50,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:50,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:50:50,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:50:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:50:50,320 INFO L87 Difference]: Start difference. First operand 143 states and 180 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:50:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:50,355 INFO L93 Difference]: Finished difference Result 236 states and 303 transitions. [2021-12-18 00:50:50,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:50:50,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2021-12-18 00:50:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:50,356 INFO L225 Difference]: With dead ends: 236 [2021-12-18 00:50:50,357 INFO L226 Difference]: Without dead ends: 132 [2021-12-18 00:50:50,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:50:50,358 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:50,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:50:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-18 00:50:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2021-12-18 00:50:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 107 states have internal predecessors, (122), 16 states have call successors, (16), 10 states have call predecessors, (16), 13 states have return successors, (23), 13 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-18 00:50:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2021-12-18 00:50:50,374 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 52 [2021-12-18 00:50:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:50,374 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2021-12-18 00:50:50,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:50:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2021-12-18 00:50:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-18 00:50:50,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:50,375 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 00:50:50,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 00:50:50,376 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -41969126, now seen corresponding path program 1 times [2021-12-18 00:50:50,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:50,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215319924] [2021-12-18 00:50:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:50,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:50:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 00:50:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-18 00:50:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:50:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-18 00:50:50,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:50,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215319924] [2021-12-18 00:50:50,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215319924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:50,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:50,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:50:50,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845739159] [2021-12-18 00:50:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:50,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:50:50,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:50:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:50:50,591 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-18 00:50:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:50,752 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2021-12-18 00:50:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:50:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2021-12-18 00:50:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:50,754 INFO L225 Difference]: With dead ends: 137 [2021-12-18 00:50:50,754 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 00:50:50,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:50:50,755 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:50,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 512 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:50:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 00:50:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-12-18 00:50:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 108 states have internal predecessors, (123), 16 states have call successors, (16), 11 states have call predecessors, (16), 13 states have return successors, (23), 13 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-18 00:50:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2021-12-18 00:50:50,765 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 58 [2021-12-18 00:50:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:50,765 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2021-12-18 00:50:50,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-18 00:50:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2021-12-18 00:50:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-18 00:50:50,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:50,766 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 00:50:50,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 00:50:50,767 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1239716043, now seen corresponding path program 1 times [2021-12-18 00:50:50,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445259501] [2021-12-18 00:50:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:50,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:50:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:50,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:50:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:50:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:50:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:50:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:50:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 00:50:51,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:51,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445259501] [2021-12-18 00:50:51,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445259501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:51,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:50:51,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:50:51,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516230918] [2021-12-18 00:50:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:51,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:50:51,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:51,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:50:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:50:51,143 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-18 00:50:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:51,474 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2021-12-18 00:50:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:50:51,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2021-12-18 00:50:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:51,475 INFO L225 Difference]: With dead ends: 142 [2021-12-18 00:50:51,476 INFO L226 Difference]: Without dead ends: 135 [2021-12-18 00:50:51,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:50:51,476 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:51,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 100 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:50:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-18 00:50:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-12-18 00:50:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.180952380952381) internal successors, (124), 110 states have internal predecessors, (124), 16 states have call successors, (16), 11 states have call predecessors, (16), 13 states have return successors, (23), 13 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-18 00:50:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2021-12-18 00:50:51,487 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 78 [2021-12-18 00:50:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:51,488 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2021-12-18 00:50:51,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-18 00:50:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2021-12-18 00:50:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-18 00:50:51,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:51,489 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-18 00:50:51,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 00:50:51,489 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2049062669, now seen corresponding path program 1 times [2021-12-18 00:50:51,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:51,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079992415] [2021-12-18 00:50:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:51,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:50:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:50:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:50:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:50:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:50:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:50:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 00:50:51,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:51,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079992415] [2021-12-18 00:50:51,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079992415] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:50:51,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526885057] [2021-12-18 00:50:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:51,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:50:51,992 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-12-18 00:50:52,021 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-12-18 00:50:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:52,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-18 00:50:52,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:50:54,515 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| 24)) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| 24)) 0)))) is different from true [2021-12-18 00:50:58,683 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| 24)) 0))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| 24)) 0)))) is different from true [2021-12-18 00:51:00,767 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| 24)) 0))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| 24)) 0)))) is different from true [2021-12-18 00:51:06,880 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| 24)) 0))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| 24)) 0)))) is different from true [2021-12-18 00:51:08,917 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| 24)) 0))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| 24)) 0)))) (let ((.cse0 (+ |c_aws_linked_list_init_#in~list.offset| 24))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_init_#in~list.base|) .cse0) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_init_#in~list.base|) .cse0) 0))))) is different from true [2021-12-18 00:51:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-18 00:51:09,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:51:10,584 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-18 00:51:10,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-18 00:51:10,591 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-18 00:51:10,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-18 00:51:10,762 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-18 00:51:10,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-18 00:51:10,770 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-18 00:51:10,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-18 00:51:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 00:51:10,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526885057] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:51:10,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:51:10,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 13] total 41 [2021-12-18 00:51:10,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304583248] [2021-12-18 00:51:10,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:51:10,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 00:51:10,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:51:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 00:51:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1113, Unknown=6, NotChecked=360, Total=1640 [2021-12-18 00:51:10,828 INFO L87 Difference]: Start difference. First operand 135 states and 163 transitions. Second operand has 41 states, 38 states have (on average 3.1842105263157894) internal successors, (121), 37 states have internal predecessors, (121), 12 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2021-12-18 00:51:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:51:52,160 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2021-12-18 00:51:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 00:51:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 3.1842105263157894) internal successors, (121), 37 states have internal predecessors, (121), 12 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) Word has length 78 [2021-12-18 00:51:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:51:52,161 INFO L225 Difference]: With dead ends: 200 [2021-12-18 00:51:52,161 INFO L226 Difference]: Without dead ends: 193 [2021-12-18 00:51:52,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=349, Invalid=2110, Unknown=11, NotChecked=500, Total=2970 [2021-12-18 00:51:52,163 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 118 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1055 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:51:52,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 287 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 752 Invalid, 0 Unknown, 1055 Unchecked, 0.5s Time] [2021-12-18 00:51:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-18 00:51:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 153. [2021-12-18 00:51:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 126 states have internal predecessors, (142), 17 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2021-12-18 00:51:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 184 transitions. [2021-12-18 00:51:52,177 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 184 transitions. Word has length 78 [2021-12-18 00:51:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:51:52,178 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 184 transitions. [2021-12-18 00:51:52,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 3.1842105263157894) internal successors, (121), 37 states have internal predecessors, (121), 12 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2021-12-18 00:51:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2021-12-18 00:51:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-18 00:51:52,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:51:52,179 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-18 00:51:52,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-18 00:51:52,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:51:52,396 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:51:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:51:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1852877617, now seen corresponding path program 1 times [2021-12-18 00:51:52,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:51:52,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671658530] [2021-12-18 00:51:52,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:51:52,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:51:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:51:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:51:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:51:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:51:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:51:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:51:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 00:51:52,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:51:52,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671658530] [2021-12-18 00:51:52,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671658530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:51:52,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:51:52,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 00:51:52,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503112736] [2021-12-18 00:51:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:51:52,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 00:51:52,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:51:52,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 00:51:52,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:51:52,760 INFO L87 Difference]: Start difference. First operand 153 states and 184 transitions. Second operand has 12 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-18 00:51:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:51:53,198 INFO L93 Difference]: Finished difference Result 172 states and 209 transitions. [2021-12-18 00:51:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:51:53,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2021-12-18 00:51:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:51:53,199 INFO L225 Difference]: With dead ends: 172 [2021-12-18 00:51:53,199 INFO L226 Difference]: Without dead ends: 150 [2021-12-18 00:51:53,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-12-18 00:51:53,200 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:51:53,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 117 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 00:51:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-18 00:51:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-18 00:51:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 123 states have internal predecessors, (136), 17 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2021-12-18 00:51:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 178 transitions. [2021-12-18 00:51:53,216 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 178 transitions. Word has length 78 [2021-12-18 00:51:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:51:53,217 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 178 transitions. [2021-12-18 00:51:53,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-18 00:51:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2021-12-18 00:51:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-18 00:51:53,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:51:53,218 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-18 00:51:53,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 00:51:53,218 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:51:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:51:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2111043055, now seen corresponding path program 1 times [2021-12-18 00:51:53,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:51:53,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669777346] [2021-12-18 00:51:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:51:53,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:51:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:51:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:51:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:51:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:51:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:51:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:51:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 00:51:53,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:51:53,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669777346] [2021-12-18 00:51:53,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669777346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:51:53,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:51:53,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 00:51:53,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241877905] [2021-12-18 00:51:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:51:53,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 00:51:53,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:51:53,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 00:51:53,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:51:53,447 INFO L87 Difference]: Start difference. First operand 150 states and 178 transitions. Second operand has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-18 00:51:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:51:53,816 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2021-12-18 00:51:53,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:51:53,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2021-12-18 00:51:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:51:53,817 INFO L225 Difference]: With dead ends: 164 [2021-12-18 00:51:53,818 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 00:51:53,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:51:53,819 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 102 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:51:53,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 123 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 00:51:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 00:51:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2021-12-18 00:51:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 100 states have (on average 1.14) internal successors, (114), 103 states have internal predecessors, (114), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2021-12-18 00:51:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2021-12-18 00:51:53,829 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 78 [2021-12-18 00:51:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:51:53,829 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2021-12-18 00:51:53,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-18 00:51:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2021-12-18 00:51:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-18 00:51:53,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:51:53,830 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 00:51:53,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 00:51:53,831 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:51:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:51:53,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1310004315, now seen corresponding path program 1 times [2021-12-18 00:51:53,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:51:53,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816648290] [2021-12-18 00:51:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:51:53,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:51:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:51:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:51:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:51:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:51:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:51:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:51:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 00:51:54,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:51:54,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816648290] [2021-12-18 00:51:54,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816648290] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:51:54,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471065783] [2021-12-18 00:51:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:51:54,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:51:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:51:54,380 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-12-18 00:51:54,381 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-12-18 00:51:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:54,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-18 00:51:54,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:51:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 00:51:57,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:52:08,753 WARN L227 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:52:18,990 WARN L227 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:52:19,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:52:19,337 INFO L354 Elim1Store]: treesize reduction 8, result has 90.7 percent of original size [2021-12-18 00:52:19,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 125 [2021-12-18 00:52:19,388 INFO L354 Elim1Store]: treesize reduction 19, result has 70.3 percent of original size [2021-12-18 00:52:19,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 124 [2021-12-18 00:52:20,133 INFO L354 Elim1Store]: treesize reduction 25, result has 75.7 percent of original size [2021-12-18 00:52:20,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 148 [2021-12-18 00:52:21,012 INFO L354 Elim1Store]: treesize reduction 25, result has 75.7 percent of original size [2021-12-18 00:52:21,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 121 [2021-12-18 00:52:21,531 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 00:52:21,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2021-12-18 00:52:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 00:52:21,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471065783] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:52:21,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:52:21,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30, 29] total 62 [2021-12-18 00:52:21,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602586758] [2021-12-18 00:52:21,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:52:21,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-18 00:52:21,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:52:21,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-18 00:52:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3511, Unknown=0, NotChecked=0, Total=3782 [2021-12-18 00:52:21,580 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 62 states, 57 states have (on average 2.456140350877193) internal successors, (140), 50 states have internal predecessors, (140), 16 states have call successors, (22), 5 states have call predecessors, (22), 17 states have return successors, (24), 16 states have call predecessors, (24), 15 states have call successors, (24) [2021-12-18 00:52:27,696 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#memory_int| |c_old(#memory_int)|) (or (= 0 (mod c___VERIFIER_assert_~cond 256)) (not (= 0 (mod |c___VERIFIER_assert_#in~cond| 256))) (and (forall ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18|) 8)) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18|)) (forall ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18|) 8)) |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18|)))) (= |c_#memory_real| |c_old(#memory_real)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2021-12-18 00:52:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:52:29,247 INFO L93 Difference]: Finished difference Result 275 states and 335 transitions. [2021-12-18 00:52:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-12-18 00:52:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 57 states have (on average 2.456140350877193) internal successors, (140), 50 states have internal predecessors, (140), 16 states have call successors, (22), 5 states have call predecessors, (22), 17 states have return successors, (24), 16 states have call predecessors, (24), 15 states have call successors, (24) Word has length 91 [2021-12-18 00:52:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:52:29,250 INFO L225 Difference]: With dead ends: 275 [2021-12-18 00:52:29,251 INFO L226 Difference]: Without dead ends: 254 [2021-12-18 00:52:29,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 156 SyntacticMatches, 9 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2595 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=919, Invalid=8983, Unknown=2, NotChecked=196, Total=10100 [2021-12-18 00:52:29,254 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 344 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 833 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:52:29,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 545 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1671 Invalid, 0 Unknown, 833 Unchecked, 1.3s Time] [2021-12-18 00:52:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-18 00:52:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 197. [2021-12-18 00:52:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 152 states have (on average 1.0921052631578947) internal successors, (166), 152 states have internal predecessors, (166), 22 states have call successors, (22), 20 states have call predecessors, (22), 22 states have return successors, (31), 24 states have call predecessors, (31), 21 states have call successors, (31) [2021-12-18 00:52:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-12-18 00:52:29,271 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 91 [2021-12-18 00:52:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:52:29,271 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-12-18 00:52:29,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 57 states have (on average 2.456140350877193) internal successors, (140), 50 states have internal predecessors, (140), 16 states have call successors, (22), 5 states have call predecessors, (22), 17 states have return successors, (24), 16 states have call predecessors, (24), 15 states have call successors, (24) [2021-12-18 00:52:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-12-18 00:52:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 00:52:29,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:52:29,273 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 00:52:29,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-18 00:52:29,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:52:29,490 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:52:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:52:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1896059343, now seen corresponding path program 1 times [2021-12-18 00:52:29,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:52:29,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124453090] [2021-12-18 00:52:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:52:29,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:52:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:52:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:52:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:52:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:52:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:52:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:52:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-18 00:52:29,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:52:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124453090] [2021-12-18 00:52:29,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124453090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:52:29,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:52:29,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:52:29,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951432829] [2021-12-18 00:52:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:52:29,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:52:29,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:52:29,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:52:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:52:29,681 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-18 00:52:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:52:29,973 INFO L93 Difference]: Finished difference Result 208 states and 229 transitions. [2021-12-18 00:52:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:52:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2021-12-18 00:52:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:52:29,981 INFO L225 Difference]: With dead ends: 208 [2021-12-18 00:52:29,981 INFO L226 Difference]: Without dead ends: 195 [2021-12-18 00:52:29,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:52:29,982 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 47 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:52:29,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 183 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:52:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-18 00:52:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-12-18 00:52:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.08) internal successors, (162), 150 states have internal predecessors, (162), 22 states have call successors, (22), 20 states have call predecessors, (22), 22 states have return successors, (29), 24 states have call predecessors, (29), 21 states have call successors, (29) [2021-12-18 00:52:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2021-12-18 00:52:29,998 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 94 [2021-12-18 00:52:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:52:29,998 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2021-12-18 00:52:29,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-18 00:52:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2021-12-18 00:52:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-18 00:52:30,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:52:30,000 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:52:30,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-18 00:52:30,001 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:52:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:52:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1936209007, now seen corresponding path program 2 times [2021-12-18 00:52:30,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:52:30,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744895389] [2021-12-18 00:52:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:52:30,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:52:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:52:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:52:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:52:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:52:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:52:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:52:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:52:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-18 00:52:30,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:52:30,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744895389] [2021-12-18 00:52:30,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744895389] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:52:30,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582564738] [2021-12-18 00:52:30,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:52:30,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:52:30,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:52:30,566 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-12-18 00:52:30,594 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-12-18 00:52:30,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:52:30,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:52:30,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-18 00:52:30,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:52:30,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2021-12-18 00:52:30,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:30,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2021-12-18 00:52:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-18 00:52:37,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:52:38,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:52:38,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:52:38,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:52:38,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:52:38,722 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 00:52:38,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 1 [2021-12-18 00:52:39,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582564738] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:52:39,557 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:52:39,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 41 [2021-12-18 00:52:39,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234063968] [2021-12-18 00:52:39,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 00:52:39,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 00:52:39,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:52:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 00:52:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2522, Unknown=2, NotChecked=0, Total=2756 [2021-12-18 00:52:39,559 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand has 41 states, 36 states have (on average 3.5277777777777777) internal successors, (127), 38 states have internal predecessors, (127), 18 states have call successors, (22), 6 states have call predecessors, (22), 12 states have return successors, (21), 15 states have call predecessors, (21), 17 states have call successors, (21) [2021-12-18 00:52:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:52:45,699 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2021-12-18 00:52:45,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-12-18 00:52:45,700 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 3.5277777777777777) internal successors, (127), 38 states have internal predecessors, (127), 18 states have call successors, (22), 6 states have call predecessors, (22), 12 states have return successors, (21), 15 states have call predecessors, (21), 17 states have call successors, (21) Word has length 102 [2021-12-18 00:52:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:52:45,701 INFO L225 Difference]: With dead ends: 241 [2021-12-18 00:52:45,701 INFO L226 Difference]: Without dead ends: 229 [2021-12-18 00:52:45,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=589, Invalid=7240, Unknown=3, NotChecked=0, Total=7832 [2021-12-18 00:52:45,703 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 92 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 00:52:45,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 843 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 877 Invalid, 0 Unknown, 689 Unchecked, 0.6s Time] [2021-12-18 00:52:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-18 00:52:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 206. [2021-12-18 00:52:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 159 states have (on average 1.0817610062893082) internal successors, (172), 159 states have internal predecessors, (172), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (31), 25 states have call predecessors, (31), 22 states have call successors, (31) [2021-12-18 00:52:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 226 transitions. [2021-12-18 00:52:45,721 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 226 transitions. Word has length 102 [2021-12-18 00:52:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:52:45,721 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 226 transitions. [2021-12-18 00:52:45,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 3.5277777777777777) internal successors, (127), 38 states have internal predecessors, (127), 18 states have call successors, (22), 6 states have call predecessors, (22), 12 states have return successors, (21), 15 states have call predecessors, (21), 17 states have call successors, (21) [2021-12-18 00:52:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 226 transitions. [2021-12-18 00:52:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-18 00:52:45,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:52:45,723 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:52:45,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-18 00:52:45,949 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,SelfDestructingSolverStorable23 [2021-12-18 00:52:45,949 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:52:45,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:52:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1678043569, now seen corresponding path program 1 times [2021-12-18 00:52:45,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:52:45,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125857490] [2021-12-18 00:52:45,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:52:45,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:52:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:52:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:52:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 00:52:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:52:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:52:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:52:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:52:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 00:52:46,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:52:46,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125857490] [2021-12-18 00:52:46,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125857490] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:52:46,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118018052] [2021-12-18 00:52:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:52:46,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:52:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:52:46,530 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-12-18 00:52:46,562 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-12-18 00:52:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:46,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-18 00:52:46,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:53:24,546 WARN L227 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:53:24,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:53:25,576 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 00:53:25,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-12-18 00:53:25,584 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-18 00:53:25,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-12-18 00:53:25,687 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:53:25,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2021-12-18 00:53:25,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:53:25,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-12-18 00:53:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 00:53:25,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118018052] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:53:25,877 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:53:25,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 16] total 42 [2021-12-18 00:53:25,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512672384] [2021-12-18 00:53:25,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:53:25,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-18 00:53:25,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:53:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-18 00:53:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1538, Unknown=7, NotChecked=0, Total=1722 [2021-12-18 00:53:25,879 INFO L87 Difference]: Start difference. First operand 206 states and 226 transitions. Second operand has 42 states, 37 states have (on average 3.810810810810811) internal successors, (141), 38 states have internal predecessors, (141), 20 states have call successors, (30), 6 states have call predecessors, (30), 11 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2021-12-18 00:53:53,360 WARN L227 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:53:53,607 INFO L93 Difference]: Finished difference Result 253 states and 283 transitions. [2021-12-18 00:53:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-18 00:53:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 3.810810810810811) internal successors, (141), 38 states have internal predecessors, (141), 20 states have call successors, (30), 6 states have call predecessors, (30), 11 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) Word has length 102 [2021-12-18 00:53:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:53:53,608 INFO L225 Difference]: With dead ends: 253 [2021-12-18 00:53:53,608 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 00:53:53,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 200 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=492, Invalid=4050, Unknown=14, NotChecked=0, Total=4556 [2021-12-18 00:53:53,611 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 206 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 525 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:53:53,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 661 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1206 Invalid, 0 Unknown, 525 Unchecked, 0.8s Time] [2021-12-18 00:53:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 00:53:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 00:53:53,612 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-12-18 00:53:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 00:53:53,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2021-12-18 00:53:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:53:53,612 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 00:53:53,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 3.810810810810811) internal successors, (141), 38 states have internal predecessors, (141), 20 states have call successors, (30), 6 states have call predecessors, (30), 11 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2021-12-18 00:53:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 00:53:53,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 00:53:53,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 00:53:53,639 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-12-18 00:53:53,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:53:53,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-18 01:03:19,897 WARN L227 SmtUtils]: Spent 9.41m on a formula simplification. DAG size of input: 300 DAG size of output: 300 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) Killed by 15