./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_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_byte_buf_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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 03:15:29,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:15:29,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:15:29,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:15:29,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:15:29,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:15:29,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:15:29,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:15:29,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:15:29,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:15:29,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:15:29,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:15:29,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:15:29,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:15:29,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:15:29,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:15:29,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:15:29,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:15:29,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:15:29,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:15:29,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:15:29,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:15:29,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:15:29,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:15:29,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:15:29,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:15:29,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:15:29,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:15:29,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:15:29,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:15:29,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:15:29,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:15:29,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:15:29,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:15:29,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:15:29,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:15:29,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:15:29,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:15:29,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:15:29,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:15:29,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:15:29,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-16 03:15:29,348 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:15:29,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:15:29,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:15:29,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:15:29,349 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:15:29,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:15:29,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:15:29,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:15:29,350 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:15:29,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:15:29,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 03:15:29,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:15:29,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:15:29,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:15:29,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:15:29,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:15:29,355 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:15:29,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:15:29,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:15:29,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:15:29,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:15:29,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:15:29,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:15:29,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:15:29,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:15:29,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 03:15:29,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 03:15:29,357 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:15:29,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:15:29,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:15:29,358 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:15:29,358 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2021-12-16 03:15:29,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:15:29,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:15:29,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:15:29,603 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:15:29,604 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:15:29,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-16 03:15:29,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec23dafb2/9cbce9b292754ab68c9db2254c0628aa/FLAGf1379eee7 [2021-12-16 03:15:30,314 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:15:30,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-16 03:15:30,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec23dafb2/9cbce9b292754ab68c9db2254c0628aa/FLAGf1379eee7 [2021-12-16 03:15:30,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec23dafb2/9cbce9b292754ab68c9db2254c0628aa [2021-12-16 03:15:30,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:15:30,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:15:30,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:15:30,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:15:30,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:15:30,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:15:30" (1/1) ... [2021-12-16 03:15:30,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d611d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:30, skipping insertion in model container [2021-12-16 03:15:30,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:15:30" (1/1) ... [2021-12-16 03:15:30,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:15:30,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:15:30,999 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_byte_buf_init_harness.i[4491,4504] [2021-12-16 03:15:31,004 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_byte_buf_init_harness.i[4551,4564] [2021-12-16 03:15:31,565 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,566 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,566 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,567 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,568 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,578 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,578 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,580 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,580 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:31,800 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:15:31,801 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:15:31,802 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:15:31,805 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:15:31,809 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:15:31,811 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:15:31,827 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:15:31,827 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:15:31,828 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:15:31,829 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:15:31,974 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:15:32,054 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,055 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:15:32,151 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:15:32,170 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_byte_buf_init_harness.i[4491,4504] [2021-12-16 03:15:32,170 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_byte_buf_init_harness.i[4551,4564] [2021-12-16 03:15:32,198 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,198 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,199 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,199 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,200 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,204 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,204 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,205 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,205 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,233 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:15:32,234 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:15:32,235 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:15:32,235 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:15:32,236 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:15:32,237 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:15:32,237 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:15:32,238 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:15:32,238 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:15:32,239 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:15:32,293 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:15:32,324 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,324 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:32,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:15:32,621 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:15:32,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32 WrapperNode [2021-12-16 03:15:32,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:15:32,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:15:32,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:15:32,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:15:32,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,855 INFO L137 Inliner]: procedures = 690, calls = 2496, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 779 [2021-12-16 03:15:32,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:15:32,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:15:32,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:15:32,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:15:32,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:15:32,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:15:32,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:15:32,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:15:32,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (1/1) ... [2021-12-16 03:15:32,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:15:32,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:32,980 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-16 03:15:33,004 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-16 03:15:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-16 03:15:33,025 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-16 03:15:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 03:15:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-16 03:15:33,025 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-16 03:15:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2021-12-16 03:15:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2021-12-16 03:15:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 03:15:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-12-16 03:15:33,028 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-12-16 03:15:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 03:15:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 03:15:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 03:15:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:15:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 03:15:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:15:33,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:15:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-16 03:15:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-16 03:15:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-12-16 03:15:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-12-16 03:15:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-16 03:15:33,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-16 03:15:33,032 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2021-12-16 03:15:33,032 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2021-12-16 03:15:33,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 03:15:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 03:15:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 03:15:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-16 03:15:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-16 03:15:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 03:15:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 03:15:33,279 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:15:33,284 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:15:33,872 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:15:33,880 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:15:33,881 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 03:15:33,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:15:33 BoogieIcfgContainer [2021-12-16 03:15:33,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:15:33,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:15:33,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:15:33,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:15:33,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:15:30" (1/3) ... [2021-12-16 03:15:33,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d347c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:15:33, skipping insertion in model container [2021-12-16 03:15:33,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:32" (2/3) ... [2021-12-16 03:15:33,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d347c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:15:33, skipping insertion in model container [2021-12-16 03:15:33,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:15:33" (3/3) ... [2021-12-16 03:15:33,890 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2021-12-16 03:15:33,894 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:15:33,895 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:15:33,939 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:15:33,949 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-16 03:15:33,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 03:15:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-16 03:15:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 03:15:33,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:33,984 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:33,984 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2021-12-16 03:15:33,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:33,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893910881] [2021-12-16 03:15:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:33,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:34,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:34,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893910881] [2021-12-16 03:15:34,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893910881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:34,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:34,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 03:15:34,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021856640] [2021-12-16 03:15:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:34,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 03:15:34,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 03:15:34,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:15:34,537 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:34,562 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2021-12-16 03:15:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 03:15:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-16 03:15:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:34,576 INFO L225 Difference]: With dead ends: 193 [2021-12-16 03:15:34,576 INFO L226 Difference]: Without dead ends: 93 [2021-12-16 03:15:34,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-16 03:15:34,582 INFO L933 BasicCegarLoop]: 121 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, 121 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-16 03:15:34,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-16 03:15:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-16 03:15:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-16 03:15:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-12-16 03:15:34,623 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2021-12-16 03:15:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:34,624 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-12-16 03:15:34,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-12-16 03:15:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 03:15:34,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:34,627 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:34,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 03:15:34,627 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2021-12-16 03:15:34,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:34,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261839986] [2021-12-16 03:15:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:34,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:34,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:34,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261839986] [2021-12-16 03:15:34,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261839986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:34,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:34,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:15:34,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304160140] [2021-12-16 03:15:34,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:34,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:15:34,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:15:34,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:15:34,844 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:34,921 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2021-12-16 03:15:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:15:34,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-16 03:15:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:34,925 INFO L225 Difference]: With dead ends: 147 [2021-12-16 03:15:34,927 INFO L226 Difference]: Without dead ends: 110 [2021-12-16 03:15:34,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:15:34,930 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:34,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 340 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-16 03:15:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2021-12-16 03:15:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-16 03:15:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-12-16 03:15:34,946 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2021-12-16 03:15:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:34,947 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-12-16 03:15:34,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-12-16 03:15:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 03:15:34,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:34,949 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:34,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 03:15:34,949 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2021-12-16 03:15:34,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:34,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732660269] [2021-12-16 03:15:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:34,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:35,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:35,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732660269] [2021-12-16 03:15:35,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732660269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:35,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:35,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 03:15:35,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855128755] [2021-12-16 03:15:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:35,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 03:15:35,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:35,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 03:15:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:35,308 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:35,396 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2021-12-16 03:15:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:15:35,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-16 03:15:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:35,399 INFO L225 Difference]: With dead ends: 134 [2021-12-16 03:15:35,399 INFO L226 Difference]: Without dead ends: 96 [2021-12-16 03:15:35,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-16 03:15:35,400 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:35,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 464 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-16 03:15:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-16 03:15:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-16 03:15:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2021-12-16 03:15:35,412 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2021-12-16 03:15:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:35,413 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2021-12-16 03:15:35,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2021-12-16 03:15:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 03:15:35,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:35,414 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:35,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 03:15:35,415 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2021-12-16 03:15:35,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:35,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136599906] [2021-12-16 03:15:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:35,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:35,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:35,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136599906] [2021-12-16 03:15:35,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136599906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:35,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:35,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:15:35,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833140764] [2021-12-16 03:15:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:35,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:15:35,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:15:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:15:35,571 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:35,595 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2021-12-16 03:15:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:15:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-16 03:15:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:35,597 INFO L225 Difference]: With dead ends: 141 [2021-12-16 03:15:35,597 INFO L226 Difference]: Without dead ends: 106 [2021-12-16 03:15:35,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:15:35,598 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:35,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-16 03:15:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2021-12-16 03:15:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-16 03:15:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-12-16 03:15:35,608 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2021-12-16 03:15:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:35,609 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-12-16 03:15:35,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-12-16 03:15:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 03:15:35,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:35,610 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:35,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 03:15:35,611 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2021-12-16 03:15:35,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:35,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178219297] [2021-12-16 03:15:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:35,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:35,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:35,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178219297] [2021-12-16 03:15:35,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178219297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:35,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:35,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:35,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886640322] [2021-12-16 03:15:35,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:35,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:35,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:35,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:35,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:35,914 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:35,984 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2021-12-16 03:15:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 03:15:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-16 03:15:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:35,987 INFO L225 Difference]: With dead ends: 110 [2021-12-16 03:15:35,988 INFO L226 Difference]: Without dead ends: 108 [2021-12-16 03:15:35,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:35,990 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:35,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 733 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-16 03:15:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-12-16 03:15:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-12-16 03:15:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2021-12-16 03:15:36,014 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2021-12-16 03:15:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:36,014 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2021-12-16 03:15:36,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2021-12-16 03:15:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:36,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:36,016 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:36,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 03:15:36,017 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2021-12-16 03:15:36,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:36,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032512068] [2021-12-16 03:15:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:36,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:36,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:36,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032512068] [2021-12-16 03:15:36,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032512068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:36,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:36,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 03:15:36,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793527897] [2021-12-16 03:15:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:36,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 03:15:36,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 03:15:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:36,293 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:36,449 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2021-12-16 03:15:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:15:36,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-16 03:15:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:36,451 INFO L225 Difference]: With dead ends: 185 [2021-12-16 03:15:36,451 INFO L226 Difference]: Without dead ends: 144 [2021-12-16 03:15:36,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:36,452 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 71 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:36,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 388 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-16 03:15:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2021-12-16 03:15:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.175) internal successors, (94), 82 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-12-16 03:15:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2021-12-16 03:15:36,464 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 41 [2021-12-16 03:15:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:36,465 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2021-12-16 03:15:36,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2021-12-16 03:15:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:36,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:36,472 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:36,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 03:15:36,472 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:36,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1320987672, now seen corresponding path program 1 times [2021-12-16 03:15:36,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:36,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054625881] [2021-12-16 03:15:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:36,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:36,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:36,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054625881] [2021-12-16 03:15:36,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054625881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:36,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:36,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:36,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893011562] [2021-12-16 03:15:36,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:36,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:36,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:36,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:36,750 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:36,909 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2021-12-16 03:15:36,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:15:36,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-16 03:15:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:36,911 INFO L225 Difference]: With dead ends: 191 [2021-12-16 03:15:36,911 INFO L226 Difference]: Without dead ends: 143 [2021-12-16 03:15:36,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:36,912 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 85 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:36,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 393 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-16 03:15:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2021-12-16 03:15:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 92 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-16 03:15:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2021-12-16 03:15:36,920 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 41 [2021-12-16 03:15:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:36,920 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2021-12-16 03:15:36,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2021-12-16 03:15:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:36,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:36,922 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:36,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 03:15:36,922 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2021-12-16 03:15:36,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55646062] [2021-12-16 03:15:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:36,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:37,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:37,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55646062] [2021-12-16 03:15:37,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55646062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:37,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:37,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:37,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554288846] [2021-12-16 03:15:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:37,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:37,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:37,327 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 03:15:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:37,671 INFO L93 Difference]: Finished difference Result 207 states and 261 transitions. [2021-12-16 03:15:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 03:15:37,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2021-12-16 03:15:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:37,673 INFO L225 Difference]: With dead ends: 207 [2021-12-16 03:15:37,673 INFO L226 Difference]: Without dead ends: 149 [2021-12-16 03:15:37,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:15:37,674 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:37,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 560 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-16 03:15:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 136. [2021-12-16 03:15:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 104 states have internal predecessors, (118), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-16 03:15:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2021-12-16 03:15:37,683 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 41 [2021-12-16 03:15:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:37,683 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2021-12-16 03:15:37,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 03:15:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2021-12-16 03:15:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:37,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:37,684 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:37,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 03:15:37,684 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -525525668, now seen corresponding path program 1 times [2021-12-16 03:15:37,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:37,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592614607] [2021-12-16 03:15:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:37,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:37,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:37,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592614607] [2021-12-16 03:15:37,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592614607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:37,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:37,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:37,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630449785] [2021-12-16 03:15:37,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:37,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:37,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:37,972 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:38,259 INFO L93 Difference]: Finished difference Result 238 states and 301 transitions. [2021-12-16 03:15:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:15:38,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-16 03:15:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:38,263 INFO L225 Difference]: With dead ends: 238 [2021-12-16 03:15:38,263 INFO L226 Difference]: Without dead ends: 170 [2021-12-16 03:15:38,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-12-16 03:15:38,265 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 39 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:38,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 555 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-16 03:15:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 140. [2021-12-16 03:15:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-16 03:15:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2021-12-16 03:15:38,280 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 41 [2021-12-16 03:15:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:38,282 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2021-12-16 03:15:38,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2021-12-16 03:15:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:38,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:38,284 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:38,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 03:15:38,284 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:38,285 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2021-12-16 03:15:38,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:38,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123398562] [2021-12-16 03:15:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:38,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:38,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:38,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123398562] [2021-12-16 03:15:38,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123398562] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:38,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:38,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:15:38,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123782530] [2021-12-16 03:15:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:38,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:15:38,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:15:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:15:38,514 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:38,602 INFO L93 Difference]: Finished difference Result 226 states and 285 transitions. [2021-12-16 03:15:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:15:38,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-16 03:15:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:38,604 INFO L225 Difference]: With dead ends: 226 [2021-12-16 03:15:38,604 INFO L226 Difference]: Without dead ends: 154 [2021-12-16 03:15:38,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:38,605 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:38,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 339 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-16 03:15:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2021-12-16 03:15:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 106 states have internal predecessors, (119), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-16 03:15:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2021-12-16 03:15:38,614 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 41 [2021-12-16 03:15:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:38,614 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2021-12-16 03:15:38,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2021-12-16 03:15:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 03:15:38,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:38,615 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:38,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 03:15:38,616 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:38,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2021-12-16 03:15:38,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:38,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129153564] [2021-12-16 03:15:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:38,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:38,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129153564] [2021-12-16 03:15:38,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129153564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:38,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:38,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:38,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705049741] [2021-12-16 03:15:38,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:38,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:38,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:38,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:38,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:38,804 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:38,908 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2021-12-16 03:15:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:15:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-16 03:15:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:38,911 INFO L225 Difference]: With dead ends: 164 [2021-12-16 03:15:38,911 INFO L226 Difference]: Without dead ends: 162 [2021-12-16 03:15:38,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:15:38,912 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:38,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 934 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-16 03:15:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-12-16 03:15:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 114 states have internal predecessors, (126), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2021-12-16 03:15:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2021-12-16 03:15:38,926 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 43 [2021-12-16 03:15:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:38,927 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2021-12-16 03:15:38,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2021-12-16 03:15:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 03:15:38,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:38,928 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:38,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 03:15:38,928 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:38,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2021-12-16 03:15:38,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:38,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21332297] [2021-12-16 03:15:38,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:38,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:39,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:39,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21332297] [2021-12-16 03:15:39,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21332297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:39,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:39,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 03:15:39,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349309503] [2021-12-16 03:15:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:39,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 03:15:39,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 03:15:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 03:15:39,196 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:39,368 INFO L93 Difference]: Finished difference Result 250 states and 307 transitions. [2021-12-16 03:15:39,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:15:39,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-16 03:15:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:39,370 INFO L225 Difference]: With dead ends: 250 [2021-12-16 03:15:39,370 INFO L226 Difference]: Without dead ends: 172 [2021-12-16 03:15:39,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:39,371 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:39,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 459 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-16 03:15:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2021-12-16 03:15:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 107 states have internal predecessors, (120), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2021-12-16 03:15:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2021-12-16 03:15:39,378 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 43 [2021-12-16 03:15:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:39,379 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2021-12-16 03:15:39,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2021-12-16 03:15:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 03:15:39,380 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:39,380 INFO L514 BasicCegarLoop]: trace histogram [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-16 03:15:39,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 03:15:39,380 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2021-12-16 03:15:39,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:39,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316850284] [2021-12-16 03:15:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:39,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 03:15:39,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:39,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316850284] [2021-12-16 03:15:39,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316850284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:39,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:39,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:39,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230499999] [2021-12-16 03:15:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:39,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:39,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:39,574 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:39,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:39,618 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2021-12-16 03:15:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 03:15:39,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2021-12-16 03:15:39,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:39,620 INFO L225 Difference]: With dead ends: 151 [2021-12-16 03:15:39,620 INFO L226 Difference]: Without dead ends: 149 [2021-12-16 03:15:39,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:39,622 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 22 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:39,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 748 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-16 03:15:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-12-16 03:15:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 114 states have internal predecessors, (126), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-16 03:15:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2021-12-16 03:15:39,631 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 57 [2021-12-16 03:15:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:39,632 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2021-12-16 03:15:39,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2021-12-16 03:15:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 03:15:39,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:39,633 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:39,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 03:15:39,633 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1061292592, now seen corresponding path program 1 times [2021-12-16 03:15:39,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:39,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176072097] [2021-12-16 03:15:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:39,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:39,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:39,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176072097] [2021-12-16 03:15:39,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176072097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:39,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:39,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:39,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695067674] [2021-12-16 03:15:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:39,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:39,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:39,879 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:40,077 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2021-12-16 03:15:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 03:15:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-16 03:15:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:40,079 INFO L225 Difference]: With dead ends: 189 [2021-12-16 03:15:40,079 INFO L226 Difference]: Without dead ends: 176 [2021-12-16 03:15:40,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:40,080 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 77 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:40,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 620 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-16 03:15:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2021-12-16 03:15:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.1565217391304348) internal successors, (133), 123 states have internal predecessors, (133), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-16 03:15:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2021-12-16 03:15:40,090 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 61 [2021-12-16 03:15:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:40,090 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2021-12-16 03:15:40,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2021-12-16 03:15:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 03:15:40,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:40,092 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:40,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 03:15:40,092 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:40,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2021-12-16 03:15:40,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:40,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553805902] [2021-12-16 03:15:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:40,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:40,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:40,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553805902] [2021-12-16 03:15:40,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553805902] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:40,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903203371] [2021-12-16 03:15:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:40,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:40,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:40,593 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-16 03:15:40,594 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-16 03:15:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-16 03:15:41,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:15:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:42,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:15:42,457 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-16 03:15:42,458 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-16 03:15:42,466 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-16 03:15:42,466 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-16 03:15:42,581 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-16 03:15:42,581 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-16 03:15:42,588 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-16 03:15:42,588 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-16 03:15:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:42,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903203371] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:15:42,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:15:42,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 30 [2021-12-16 03:15:42,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432511126] [2021-12-16 03:15:42,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:15:42,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-16 03:15:42,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-16 03:15:42,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2021-12-16 03:15:42,676 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-16 03:15:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:44,165 INFO L93 Difference]: Finished difference Result 242 states and 297 transitions. [2021-12-16 03:15:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-16 03:15:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 61 [2021-12-16 03:15:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:44,170 INFO L225 Difference]: With dead ends: 242 [2021-12-16 03:15:44,170 INFO L226 Difference]: Without dead ends: 203 [2021-12-16 03:15:44,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=441, Invalid=2109, Unknown=0, NotChecked=0, Total=2550 [2021-12-16 03:15:44,172 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 229 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:44,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 1935 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 537 Invalid, 0 Unknown, 186 Unchecked, 0.5s Time] [2021-12-16 03:15:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-16 03:15:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2021-12-16 03:15:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.144927536231884) internal successors, (158), 147 states have internal predecessors, (158), 26 states have call successors, (26), 14 states have call predecessors, (26), 20 states have return successors, (42), 23 states have call predecessors, (42), 25 states have call successors, (42) [2021-12-16 03:15:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2021-12-16 03:15:44,182 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 61 [2021-12-16 03:15:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:44,183 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2021-12-16 03:15:44,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-16 03:15:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2021-12-16 03:15:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 03:15:44,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:44,184 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:44,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 03:15:44,399 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,SelfDestructingSolverStorable14 [2021-12-16 03:15:44,400 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash -785220748, now seen corresponding path program 1 times [2021-12-16 03:15:44,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:44,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952205294] [2021-12-16 03:15:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:44,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:44,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:44,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:44,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:44,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952205294] [2021-12-16 03:15:44,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952205294] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:44,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:44,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-16 03:15:44,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109625738] [2021-12-16 03:15:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:44,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 03:15:44,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 03:15:44,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-16 03:15:44,739 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:45,037 INFO L93 Difference]: Finished difference Result 225 states and 276 transitions. [2021-12-16 03:15:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 03:15:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-16 03:15:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:45,039 INFO L225 Difference]: With dead ends: 225 [2021-12-16 03:15:45,039 INFO L226 Difference]: Without dead ends: 212 [2021-12-16 03:15:45,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-12-16 03:15:45,040 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:45,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 610 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-16 03:15:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2021-12-16 03:15:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.144927536231884) internal successors, (158), 147 states have internal predecessors, (158), 26 states have call successors, (26), 14 states have call predecessors, (26), 20 states have return successors, (42), 23 states have call predecessors, (42), 25 states have call successors, (42) [2021-12-16 03:15:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2021-12-16 03:15:45,050 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 61 [2021-12-16 03:15:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:45,050 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2021-12-16 03:15:45,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2021-12-16 03:15:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-16 03:15:45,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:45,051 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] [2021-12-16 03:15:45,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 03:15:45,052 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:45,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2021-12-16 03:15:45,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:45,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174171840] [2021-12-16 03:15:45,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:45,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-16 03:15:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 03:15:45,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:45,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174171840] [2021-12-16 03:15:45,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174171840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:45,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:45,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:15:45,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949603094] [2021-12-16 03:15:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:45,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:45,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:45,358 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-16 03:15:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:45,541 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2021-12-16 03:15:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 03:15:45,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2021-12-16 03:15:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:45,543 INFO L225 Difference]: With dead ends: 199 [2021-12-16 03:15:45,543 INFO L226 Difference]: Without dead ends: 197 [2021-12-16 03:15:45,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-16 03:15:45,544 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 43 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:45,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 589 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-16 03:15:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2021-12-16 03:15:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.1408450704225352) internal successors, (162), 151 states have internal predecessors, (162), 29 states have call successors, (29), 15 states have call predecessors, (29), 21 states have return successors, (45), 26 states have call predecessors, (45), 28 states have call successors, (45) [2021-12-16 03:15:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2021-12-16 03:15:45,557 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 63 [2021-12-16 03:15:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:45,557 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2021-12-16 03:15:45,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-16 03:15:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2021-12-16 03:15:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-16 03:15:45,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:45,558 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:45,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 03:15:45,559 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:45,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2021-12-16 03:15:45,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:45,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982826884] [2021-12-16 03:15:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:45,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 03:15:45,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982826884] [2021-12-16 03:15:45,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982826884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:45,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:45,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:45,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652784363] [2021-12-16 03:15:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:45,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:45,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:45,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:45,774 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:45,875 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2021-12-16 03:15:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:15:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-12-16 03:15:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:45,877 INFO L225 Difference]: With dead ends: 209 [2021-12-16 03:15:45,877 INFO L226 Difference]: Without dead ends: 207 [2021-12-16 03:15:45,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:15:45,878 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:45,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 955 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-16 03:15:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2021-12-16 03:15:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 29 states have call successors, (29), 15 states have call predecessors, (29), 22 states have return successors, (46), 26 states have call predecessors, (46), 28 states have call successors, (46) [2021-12-16 03:15:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2021-12-16 03:15:45,888 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 63 [2021-12-16 03:15:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:45,888 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2021-12-16 03:15:45,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2021-12-16 03:15:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-16 03:15:45,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:45,889 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:45,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 03:15:45,890 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2021-12-16 03:15:45,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:45,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110023611] [2021-12-16 03:15:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:45,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:46,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:46,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110023611] [2021-12-16 03:15:46,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110023611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:46,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:46,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:46,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682609707] [2021-12-16 03:15:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:46,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:46,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:46,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:46,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:46,098 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:46,250 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2021-12-16 03:15:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:15:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2021-12-16 03:15:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:46,252 INFO L225 Difference]: With dead ends: 225 [2021-12-16 03:15:46,252 INFO L226 Difference]: Without dead ends: 208 [2021-12-16 03:15:46,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:46,253 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 43 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:46,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 464 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-16 03:15:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 187. [2021-12-16 03:15:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.145985401459854) internal successors, (157), 145 states have internal predecessors, (157), 29 states have call successors, (29), 15 states have call predecessors, (29), 20 states have return successors, (41), 26 states have call predecessors, (41), 28 states have call successors, (41) [2021-12-16 03:15:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2021-12-16 03:15:46,263 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 63 [2021-12-16 03:15:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:46,263 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2021-12-16 03:15:46,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2021-12-16 03:15:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 03:15:46,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:46,265 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 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] [2021-12-16 03:15:46,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 03:15:46,265 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2021-12-16 03:15:46,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:46,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533120835] [2021-12-16 03:15:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:46,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-16 03:15:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 03:15:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:15:46,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:46,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533120835] [2021-12-16 03:15:46,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533120835] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:46,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:46,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:46,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882242823] [2021-12-16 03:15:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:46,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:46,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:46,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:46,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:46,469 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-16 03:15:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:46,626 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2021-12-16 03:15:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:15:46,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2021-12-16 03:15:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:46,628 INFO L225 Difference]: With dead ends: 197 [2021-12-16 03:15:46,628 INFO L226 Difference]: Without dead ends: 195 [2021-12-16 03:15:46,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:46,630 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:46,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 687 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-16 03:15:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2021-12-16 03:15:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 141 states have (on average 1.1418439716312057) internal successors, (161), 149 states have internal predecessors, (161), 30 states have call successors, (30), 16 states have call predecessors, (30), 21 states have return successors, (42), 27 states have call predecessors, (42), 29 states have call successors, (42) [2021-12-16 03:15:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 233 transitions. [2021-12-16 03:15:46,645 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 233 transitions. Word has length 69 [2021-12-16 03:15:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:46,646 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 233 transitions. [2021-12-16 03:15:46,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-16 03:15:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 233 transitions. [2021-12-16 03:15:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 03:15:46,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:46,648 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 03:15:46,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 03:15:46,648 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2021-12-16 03:15:46,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:46,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681666167] [2021-12-16 03:15:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:46,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:15:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-16 03:15:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:47,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:47,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681666167] [2021-12-16 03:15:47,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681666167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:47,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:47,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 03:15:47,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616217221] [2021-12-16 03:15:47,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:47,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 03:15:47,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 03:15:47,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:47,114 INFO L87 Difference]: Start difference. First operand 193 states and 233 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:47,508 INFO L93 Difference]: Finished difference Result 242 states and 293 transitions. [2021-12-16 03:15:47,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 03:15:47,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2021-12-16 03:15:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:47,510 INFO L225 Difference]: With dead ends: 242 [2021-12-16 03:15:47,510 INFO L226 Difference]: Without dead ends: 216 [2021-12-16 03:15:47,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:15:47,511 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 77 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:47,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 721 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-16 03:15:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2021-12-16 03:15:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.1388888888888888) internal successors, (164), 152 states have internal predecessors, (164), 32 states have call successors, (32), 16 states have call predecessors, (32), 21 states have return successors, (45), 29 states have call predecessors, (45), 31 states have call successors, (45) [2021-12-16 03:15:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 241 transitions. [2021-12-16 03:15:47,522 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 241 transitions. Word has length 67 [2021-12-16 03:15:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:47,522 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 241 transitions. [2021-12-16 03:15:47,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 241 transitions. [2021-12-16 03:15:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-16 03:15:47,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:47,524 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2021-12-16 03:15:47,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 03:15:47,524 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2021-12-16 03:15:47,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:47,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215602680] [2021-12-16 03:15:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:47,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 03:15:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-16 03:15:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 03:15:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 03:15:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,007 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-16 03:15:48,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:48,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215602680] [2021-12-16 03:15:48,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215602680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:48,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:48,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 03:15:48,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032530637] [2021-12-16 03:15:48,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:48,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 03:15:48,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:48,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 03:15:48,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:48,010 INFO L87 Difference]: Start difference. First operand 198 states and 241 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 03:15:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:48,306 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2021-12-16 03:15:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2021-12-16 03:15:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:48,309 INFO L225 Difference]: With dead ends: 206 [2021-12-16 03:15:48,309 INFO L226 Difference]: Without dead ends: 154 [2021-12-16 03:15:48,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:15:48,310 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 162 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:48,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 617 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-16 03:15:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2021-12-16 03:15:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2021-12-16 03:15:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2021-12-16 03:15:48,316 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 75 [2021-12-16 03:15:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:48,317 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2021-12-16 03:15:48,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 03:15:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2021-12-16 03:15:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 03:15:48,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:48,319 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:48,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 03:15:48,320 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2021-12-16 03:15:48,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:48,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319158170] [2021-12-16 03:15:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:48,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:15:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 03:15:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 03:15:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 03:15:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:15:48,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:48,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319158170] [2021-12-16 03:15:48,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319158170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:48,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:48,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:48,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682045704] [2021-12-16 03:15:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:48,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:48,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:48,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:48,555 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-16 03:15:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:48,882 INFO L93 Difference]: Finished difference Result 243 states and 288 transitions. [2021-12-16 03:15:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 03:15:48,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2021-12-16 03:15:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:48,884 INFO L225 Difference]: With dead ends: 243 [2021-12-16 03:15:48,884 INFO L226 Difference]: Without dead ends: 153 [2021-12-16 03:15:48,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-16 03:15:48,885 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 103 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:48,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 345 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-16 03:15:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2021-12-16 03:15:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 109 states have internal predecessors, (119), 24 states have call successors, (24), 12 states have call predecessors, (24), 16 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-16 03:15:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2021-12-16 03:15:48,898 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 79 [2021-12-16 03:15:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:48,898 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2021-12-16 03:15:48,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-16 03:15:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2021-12-16 03:15:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-16 03:15:48,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:48,902 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:48,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 03:15:48,902 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2021-12-16 03:15:48,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:48,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587454188] [2021-12-16 03:15:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:48,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:15:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 03:15:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 03:15:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 03:15:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:15:49,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587454188] [2021-12-16 03:15:49,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587454188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:49,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:49,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 03:15:49,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108692751] [2021-12-16 03:15:49,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:49,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 03:15:49,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 03:15:49,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:49,216 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 03:15:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:49,733 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2021-12-16 03:15:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 03:15:49,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-16 03:15:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:49,735 INFO L225 Difference]: With dead ends: 244 [2021-12-16 03:15:49,735 INFO L226 Difference]: Without dead ends: 177 [2021-12-16 03:15:49,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-12-16 03:15:49,737 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 169 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:49,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 447 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:15:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-16 03:15:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2021-12-16 03:15:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1454545454545455) internal successors, (126), 115 states have internal predecessors, (126), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-16 03:15:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 178 transitions. [2021-12-16 03:15:49,745 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 178 transitions. Word has length 85 [2021-12-16 03:15:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:49,746 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 178 transitions. [2021-12-16 03:15:49,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 03:15:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2021-12-16 03:15:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-16 03:15:49,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:49,750 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:49,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 03:15:49,751 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2021-12-16 03:15:49,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:49,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136695984] [2021-12-16 03:15:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:49,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:15:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 03:15:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 03:15:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 03:15:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:15:49,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:49,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136695984] [2021-12-16 03:15:49,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136695984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:49,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:49,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 03:15:49,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173799707] [2021-12-16 03:15:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:49,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 03:15:49,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 03:15:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 03:15:49,988 INFO L87 Difference]: Start difference. First operand 152 states and 178 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 03:15:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:50,224 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2021-12-16 03:15:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:15:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-16 03:15:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:50,228 INFO L225 Difference]: With dead ends: 224 [2021-12-16 03:15:50,228 INFO L226 Difference]: Without dead ends: 156 [2021-12-16 03:15:50,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:50,229 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 71 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:50,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-16 03:15:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2021-12-16 03:15:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.128440366972477) internal successors, (123), 114 states have internal predecessors, (123), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-16 03:15:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2021-12-16 03:15:50,237 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 85 [2021-12-16 03:15:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:50,238 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2021-12-16 03:15:50,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 03:15:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2021-12-16 03:15:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-16 03:15:50,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:50,239 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:50,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 03:15:50,239 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1899820425, now seen corresponding path program 1 times [2021-12-16 03:15:50,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:50,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349253963] [2021-12-16 03:15:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:50,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:15:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 03:15:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 03:15:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 03:15:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:15:50,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:50,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349253963] [2021-12-16 03:15:50,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349253963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:50,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:50,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 03:15:50,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800381470] [2021-12-16 03:15:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:50,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 03:15:50,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:50,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 03:15:50,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 03:15:50,430 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 03:15:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:50,630 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2021-12-16 03:15:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:15:50,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2021-12-16 03:15:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:50,631 INFO L225 Difference]: With dead ends: 211 [2021-12-16 03:15:50,631 INFO L226 Difference]: Without dead ends: 100 [2021-12-16 03:15:50,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:50,632 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:50,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-16 03:15:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-12-16 03:15:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-12-16 03:15:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-12-16 03:15:50,637 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 87 [2021-12-16 03:15:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:50,638 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-12-16 03:15:50,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 03:15:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-12-16 03:15:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-16 03:15:50,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:50,639 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:50,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 03:15:50,642 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:50,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2021-12-16 03:15:50,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:50,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546817045] [2021-12-16 03:15:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:50,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:15:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 03:15:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 03:15:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:15:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-16 03:15:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-16 03:15:51,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:51,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546817045] [2021-12-16 03:15:51,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546817045] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:51,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:51,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-16 03:15:51,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945222534] [2021-12-16 03:15:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:51,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 03:15:51,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 03:15:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:51,321 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-16 03:15:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:51,857 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2021-12-16 03:15:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:15:51,858 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2021-12-16 03:15:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:51,859 INFO L225 Difference]: With dead ends: 150 [2021-12-16 03:15:51,859 INFO L226 Difference]: Without dead ends: 95 [2021-12-16 03:15:51,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-12-16 03:15:51,860 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 221 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:51,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 248 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:15:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-16 03:15:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-16 03:15:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-16 03:15:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-12-16 03:15:51,865 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2021-12-16 03:15:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:51,865 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-12-16 03:15:51,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-16 03:15:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-12-16 03:15:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-16 03:15:51,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:51,866 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:51,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-16 03:15:51,867 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2021-12-16 03:15:51,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:51,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141195337] [2021-12-16 03:15:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:51,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:15:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:15:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:15:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 03:15:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 03:15:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:15:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-16 03:15:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-16 03:15:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 03:15:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-16 03:15:52,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:52,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141195337] [2021-12-16 03:15:52,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141195337] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:52,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837406048] [2021-12-16 03:15:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:52,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:52,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:52,664 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-16 03:15:52,675 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-16 03:15:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:53,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-16 03:15:53,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:15:53,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:15:53,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:15:53,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:15:53,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-16 03:15:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-16 03:15:54,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:15:54,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837406048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:54,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 03:15:54,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2021-12-16 03:15:54,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358388442] [2021-12-16 03:15:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:54,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 03:15:54,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:54,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 03:15:54,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-12-16 03:15:54,027 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-16 03:15:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:54,110 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2021-12-16 03:15:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:15:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 116 [2021-12-16 03:15:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:54,111 INFO L225 Difference]: With dead ends: 95 [2021-12-16 03:15:54,111 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 03:15:54,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-12-16 03:15:54,112 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:54,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 470 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2021-12-16 03:15:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 03:15:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 03:15:54,113 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-16 03:15:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 03:15:54,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2021-12-16 03:15:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:54,113 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 03:15:54,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-16 03:15:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 03:15:54,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 03:15:54,116 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 03:15:54,146 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-16 03:15:54,316 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,SelfDestructingSolverStorable27 [2021-12-16 03:15:54,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 03:15:57,221 INFO L854 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-16 03:15:57,221 INFO L854 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6893 6897) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-16 03:15:57,221 INFO L858 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2021-12-16 03:15:57,221 INFO L854 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-16 03:15:57,221 INFO L858 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2021-12-16 03:15:57,221 INFO L858 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2021-12-16 03:15:57,221 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2021-12-16 03:15:57,221 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2021-12-16 03:15:57,221 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L854 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L854 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6922 6932) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L858 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2021-12-16 03:15:57,222 INFO L854 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.base 0) (<= 0 aws_mem_acquire_~mem~0.offset) (<= aws_mem_acquire_~mem~0.offset 0) (<= 0 aws_mem_acquire_~mem~0.base)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-16 03:15:57,222 INFO L854 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-16 03:15:57,222 INFO L854 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-16 03:15:57,222 INFO L854 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-16 03:15:57,223 INFO L854 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2021-12-16 03:15:57,223 INFO L858 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-16 03:15:57,224 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-16 03:15:57,224 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L861 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2021-12-16 03:15:57,225 INFO L861 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L854 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16))) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2021-12-16 03:15:57,225 INFO L858 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L854 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse1 (<= .cse16 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse15) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse3 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse4 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse16)) (.cse9 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse15) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse12 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)))) (let ((.cse14 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse14) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse14) 0) .cse10 .cse11 .cse12 .cse13))))) [2021-12-16 03:15:57,226 INFO L861 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L854 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse1 (<= .cse18 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1| 1)) (.cse5 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse6 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse18)) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1|)) (.cse13 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse15 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse3) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse3) 0) .cse12 .cse13 .cse14 .cse15 .cse16)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|))))) [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L854 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1151#1| 0) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2021-12-16 03:15:57,226 INFO L858 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2021-12-16 03:15:57,227 INFO L858 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2021-12-16 03:15:57,227 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 03:15:57,227 INFO L854 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616))) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse11 (<= .cse18 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse5 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse8 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse18)) (.cse14 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse15 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse4 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse6 (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0)) (and .cse1 .cse11 .cse12 .cse5 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 .cse6 .cse9 (< .cse0 |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse1 .cse11 .cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse16) 0) .cse5 .cse7 .cse8 .cse10 .cse13 .cse14 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse16) 0) .cse15 .cse2 .cse3 .cse4 .cse6 .cse9))))) [2021-12-16 03:15:57,227 INFO L854 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1|))) [2021-12-16 03:15:57,227 INFO L854 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|)) (= |~#s_can_fail_allocator_static~0.offset| 0) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) [2021-12-16 03:15:57,227 INFO L858 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2021-12-16 03:15:57,227 INFO L854 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) [2021-12-16 03:15:57,227 INFO L854 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) [2021-12-16 03:15:57,227 INFO L858 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2021-12-16 03:15:57,227 INFO L858 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2021-12-16 03:15:57,227 INFO L858 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2021-12-16 03:15:57,227 INFO L854 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (not (= 0 (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616))) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) [2021-12-16 03:15:57,228 INFO L854 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse17 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse1 (<= .cse17 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse3 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse5 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse7 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse17)) (.cse8 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse9 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse10 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse12 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse13 (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (let ((.cse15 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse15) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse15) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2021-12-16 03:15:57,228 INFO L854 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16))) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1|))) [2021-12-16 03:15:57,228 INFO L858 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2021-12-16 03:15:57,228 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-16 03:15:57,228 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-16 03:15:57,228 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-16 03:15:57,228 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-16 03:15:57,228 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-16 03:15:57,228 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-16 03:15:57,231 INFO L732 BasicCegarLoop]: Path program 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-16 03:15:57,234 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 03:15:57,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:15:57 BoogieIcfgContainer [2021-12-16 03:15:57,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 03:15:57,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 03:15:57,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 03:15:57,253 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 03:15:57,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:15:33" (3/4) ... [2021-12-16 03:15:57,256 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 03:15:57,260 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2021-12-16 03:15:57,260 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2021-12-16 03:15:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-16 03:15:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2021-12-16 03:15:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-16 03:15:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-16 03:15:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-16 03:15:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-16 03:15:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-12-16 03:15:57,262 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-16 03:15:57,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2021-12-16 03:15:57,273 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2021-12-16 03:15:57,274 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-16 03:15:57,274 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-16 03:15:57,275 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-16 03:15:57,276 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-16 03:15:57,277 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 03:15:57,278 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 03:15:57,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(capacity == 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && buf < s_can_fail_allocator_static + 1) && 0 == buf) && buf == 0) && s_can_fail_allocator_static <= buf) && allocator == allocator) && buf == buf) && \result + 1 <= 0) || (((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity)) || ((((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && #memory_$Pointer$[buf][buf + 8] == 0) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) [2021-12-16 03:15:57,958 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 03:15:57,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 03:15:57,959 INFO L158 Benchmark]: Toolchain (without parser) took 27276.59ms. Allocated memory was 98.6MB in the beginning and 490.7MB in the end (delta: 392.2MB). Free memory was 56.9MB in the beginning and 182.2MB in the end (delta: -125.3MB). Peak memory consumption was 326.4MB. Max. memory is 16.1GB. [2021-12-16 03:15:57,959 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 03:15:57,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1936.80ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.7MB in the beginning and 52.1MB in the end (delta: 4.6MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2021-12-16 03:15:57,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 232.78ms. Allocated memory was 119.5MB in the beginning and 184.5MB in the end (delta: 65.0MB). Free memory was 52.1MB in the beginning and 133.0MB in the end (delta: -80.9MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2021-12-16 03:15:57,962 INFO L158 Benchmark]: Boogie Preprocessor took 94.55ms. Allocated memory is still 184.5MB. Free memory was 133.0MB in the beginning and 126.8MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 03:15:57,962 INFO L158 Benchmark]: RCFGBuilder took 930.77ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 118.7MB in the end (delta: 8.0MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2021-12-16 03:15:57,962 INFO L158 Benchmark]: TraceAbstraction took 23368.22ms. Allocated memory was 184.5MB in the beginning and 408.9MB in the end (delta: 224.4MB). Free memory was 117.7MB in the beginning and 161.6MB in the end (delta: -43.9MB). Peak memory consumption was 237.6MB. Max. memory is 16.1GB. [2021-12-16 03:15:57,962 INFO L158 Benchmark]: Witness Printer took 706.08ms. Allocated memory was 408.9MB in the beginning and 490.7MB in the end (delta: 81.8MB). Free memory was 161.6MB in the beginning and 182.2MB in the end (delta: -20.6MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2021-12-16 03:15:57,963 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1936.80ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.7MB in the beginning and 52.1MB in the end (delta: 4.6MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 232.78ms. Allocated memory was 119.5MB in the beginning and 184.5MB in the end (delta: 65.0MB). Free memory was 52.1MB in the beginning and 133.0MB in the end (delta: -80.9MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.55ms. Allocated memory is still 184.5MB. Free memory was 133.0MB in the beginning and 126.8MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 930.77ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 118.7MB in the end (delta: 8.0MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23368.22ms. Allocated memory was 184.5MB in the beginning and 408.9MB in the end (delta: 224.4MB). Free memory was 117.7MB in the beginning and 161.6MB in the end (delta: -43.9MB). Peak memory consumption was 237.6MB. Max. memory is 16.1GB. * Witness Printer took 706.08ms. Allocated memory was 408.9MB in the beginning and 490.7MB in the end (delta: 81.8MB). Free memory was 161.6MB in the beginning and 182.2MB in the end (delta: -20.6MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2042 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1897 mSDsluCounter, 15533 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 225 IncrementalHoareTripleChecker+Unchecked, 12564 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4346 IncrementalHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 2969 mSDtfsCounter, 4346 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 627 SyntacticMatches, 9 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=18, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 352 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 183 PreInvPairs, 206 NumberOfFragments, 1336 HoareAnnotationTreeSize, 183 FomulaSimplifications, 415 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 32 FomulaSimplificationsInter, 237269 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1817 NumberOfCodeBlocks, 1817 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1847 ConstructedInterpolants, 55 QuantifiedInterpolants, 10536 SizeOfPredicates, 38 NumberOfNonLiveVariables, 5076 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 541/579 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7110]: Loop Invariant [2021-12-16 03:15:57,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 03:15:57,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 03:15:57,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((!(capacity == 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && buf < s_can_fail_allocator_static + 1) && 0 == buf) && buf == 0) && s_can_fail_allocator_static <= buf) && allocator == allocator) && buf == buf) && \result + 1 <= 0) || (((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity)) || ((((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && #memory_$Pointer$[buf][buf + 8] == 0) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-16 03:15:58,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE