./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678b828e 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 /storage/repos/ultimate/trunk/examples/svcomp/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 2555a6c6e6d3f77d5d21b6f07a8080dab24cab6c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-678b828 [2020-12-07 16:12:54,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-07 16:12:54,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-07 16:12:54,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-07 16:12:54,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-07 16:12:54,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-07 16:12:54,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-07 16:12:54,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-07 16:12:54,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-07 16:12:54,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-07 16:12:54,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-07 16:12:54,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-07 16:12:54,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-07 16:12:54,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-07 16:12:54,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-07 16:12:54,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-07 16:12:54,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-07 16:12:54,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-07 16:12:54,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-07 16:12:54,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-07 16:12:54,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-07 16:12:54,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-07 16:12:54,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-07 16:12:54,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-07 16:12:54,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-07 16:12:54,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-07 16:12:54,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-07 16:12:54,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-07 16:12:54,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-07 16:12:54,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-07 16:12:54,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-07 16:12:54,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-07 16:12:54,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-07 16:12:54,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-07 16:12:54,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-07 16:12:54,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-07 16:12:54,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-07 16:12:54,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-07 16:12:54,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-07 16:12:54,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-07 16:12:54,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-07 16:12:54,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-07 16:12:54,417 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-07 16:12:54,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-07 16:12:54,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-07 16:12:54,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-07 16:12:54,425 INFO L138 SettingsManager]: * Use SBE=true [2020-12-07 16:12:54,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-07 16:12:54,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-07 16:12:54,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-07 16:12:54,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-07 16:12:54,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-07 16:12:54,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-07 16:12:54,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-07 16:12:54,429 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-07 16:12:54,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-07 16:12:54,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-07 16:12:54,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-07 16:12:54,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-07 16:12:54,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-07 16:12:54,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-07 16:12:54,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-07 16:12:54,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-07 16:12:54,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-07 16:12:54,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-07 16:12:54,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-07 16:12:54,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-07 16:12:54,433 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 -> 2555a6c6e6d3f77d5d21b6f07a8080dab24cab6c [2020-12-07 16:12:54,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-07 16:12:54,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-07 16:12:54,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-07 16:12:54,977 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-07 16:12:54,979 INFO L275 PluginConnector]: CDTParser initialized [2020-12-07 16:12:54,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i [2020-12-07 16:12:55,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4360e3e/c46d17c727c24ed7a4acc103c770b61b/FLAG2908b402b [2020-12-07 16:12:56,366 INFO L306 CDTParser]: Found 1 translation units. [2020-12-07 16:12:56,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i [2020-12-07 16:12:56,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4360e3e/c46d17c727c24ed7a4acc103c770b61b/FLAG2908b402b [2020-12-07 16:12:56,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4360e3e/c46d17c727c24ed7a4acc103c770b61b [2020-12-07 16:12:56,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-07 16:12:56,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-07 16:12:56,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-07 16:12:56,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-07 16:12:56,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-07 16:12:56,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:12:56" (1/1) ... [2020-12-07 16:12:56,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d024f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:12:56, skipping insertion in model container [2020-12-07 16:12:56,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:12:56" (1/1) ... [2020-12-07 16:12:56,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-07 16:12:56,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-07 16:12:57,180 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2020-12-07 16:12:57,192 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2020-12-07 16:12:57,231 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-07 16:12:57,244 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-07 16:12:58,539 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,541 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,542 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,543 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,546 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,563 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,565 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,567 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:58,568 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,181 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-07 16:12:59,183 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-07 16:12:59,185 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-07 16:12:59,186 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-07 16:12:59,190 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-07 16:12:59,191 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-07 16:12:59,193 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-07 16:12:59,194 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-07 16:12:59,196 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-07 16:12:59,198 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-07 16:12:59,443 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-07 16:12:59,561 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,562 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-07 16:12:59,749 INFO L203 MainTranslator]: Completed pre-run [2020-12-07 16:12:59,768 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2020-12-07 16:12:59,770 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2020-12-07 16:12:59,773 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-07 16:12:59,775 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-07 16:12:59,848 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,850 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,850 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,851 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,852 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,862 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,863 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,865 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,866 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:12:59,931 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-07 16:12:59,933 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-07 16:12:59,935 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-07 16:12:59,937 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-07 16:12:59,939 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-07 16:12:59,940 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-07 16:12:59,941 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-07 16:12:59,942 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-07 16:12:59,942 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-07 16:12:59,943 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-07 16:12:59,979 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-07 16:13:00,062 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:13:00,063 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:13:00,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-07 16:13:01,646 INFO L208 MainTranslator]: Completed translation [2020-12-07 16:13:01,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01 WrapperNode [2020-12-07 16:13:01,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-07 16:13:01,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-07 16:13:01,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-07 16:13:01,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-07 16:13:01,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:01,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:01,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-07 16:13:01,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-07 16:13:01,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-07 16:13:01,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-07 16:13:01,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:01,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:01,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:01,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:02,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:02,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:02,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... [2020-12-07 16:13:02,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-07 16:13:02,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-07 16:13:02,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-07 16:13:02,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-07 16:13:02,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-07 16:13:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-07 16:13:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-07 16:13:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-07 16:13:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-07 16:13:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-07 16:13:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-07 16:13:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-07 16:13:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-07 16:13:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-07 16:13:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-07 16:13:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-07 16:13:12,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-07 16:13:12,938 INFO L299 CfgBuilder]: Removed 50 assume(true) statements. [2020-12-07 16:13:12,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:13:12 BoogieIcfgContainer [2020-12-07 16:13:12,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-07 16:13:12,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-07 16:13:12,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-07 16:13:12,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-07 16:13:12,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:12:56" (1/3) ... [2020-12-07 16:13:12,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52870b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:13:12, skipping insertion in model container [2020-12-07 16:13:12,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:01" (2/3) ... [2020-12-07 16:13:12,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52870b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:13:12, skipping insertion in model container [2020-12-07 16:13:12,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:13:12" (3/3) ... [2020-12-07 16:13:12,954 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2020-12-07 16:13:12,975 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-07 16:13:12,981 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-07 16:13:13,000 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-07 16:13:13,038 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-07 16:13:13,038 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-07 16:13:13,039 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-07 16:13:13,039 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-07 16:13:13,039 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-07 16:13:13,039 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-07 16:13:13,040 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-07 16:13:13,040 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-07 16:13:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2020-12-07 16:13:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-07 16:13:13,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:13,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:13,075 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1714787328, now seen corresponding path program 1 times [2020-12-07 16:13:13,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:13,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301161218] [2020-12-07 16:13:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:14,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301161218] [2020-12-07 16:13:14,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:14,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-07 16:13:14,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537551026] [2020-12-07 16:13:14,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-07 16:13:14,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-07 16:13:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-07 16:13:14,150 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2020-12-07 16:13:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:14,207 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2020-12-07 16:13:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-07 16:13:14,209 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-12-07 16:13:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:14,223 INFO L225 Difference]: With dead ends: 166 [2020-12-07 16:13:14,223 INFO L226 Difference]: Without dead ends: 79 [2020-12-07 16:13:14,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-07 16:13:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-07 16:13:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-07 16:13:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-07 16:13:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2020-12-07 16:13:14,286 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 15 [2020-12-07 16:13:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:14,287 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-12-07 16:13:14,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-07 16:13:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2020-12-07 16:13:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-07 16:13:14,289 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:14,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:14,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-07 16:13:14,290 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1972952766, now seen corresponding path program 1 times [2020-12-07 16:13:14,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:14,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627819932] [2020-12-07 16:13:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:14,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627819932] [2020-12-07 16:13:14,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:14,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 16:13:14,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79255585] [2020-12-07 16:13:14,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 16:13:14,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:14,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 16:13:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:13:14,784 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 5 states. [2020-12-07 16:13:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:14,951 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2020-12-07 16:13:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 16:13:14,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-07 16:13:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:14,954 INFO L225 Difference]: With dead ends: 117 [2020-12-07 16:13:14,954 INFO L226 Difference]: Without dead ends: 79 [2020-12-07 16:13:14,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-07 16:13:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-07 16:13:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-07 16:13:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-07 16:13:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2020-12-07 16:13:14,966 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 15 [2020-12-07 16:13:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:14,966 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2020-12-07 16:13:14,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 16:13:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2020-12-07 16:13:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-07 16:13:14,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:14,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:14,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-07 16:13:14,968 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1369831661, now seen corresponding path program 1 times [2020-12-07 16:13:14,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:14,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040488004] [2020-12-07 16:13:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:15,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040488004] [2020-12-07 16:13:15,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:15,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-07 16:13:15,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662449737] [2020-12-07 16:13:15,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-07 16:13:15,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-07 16:13:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-07 16:13:15,744 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 6 states. [2020-12-07 16:13:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:16,087 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2020-12-07 16:13:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-07 16:13:16,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-07 16:13:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:16,090 INFO L225 Difference]: With dead ends: 124 [2020-12-07 16:13:16,090 INFO L226 Difference]: Without dead ends: 120 [2020-12-07 16:13:16,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-07 16:13:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-07 16:13:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2020-12-07 16:13:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-07 16:13:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2020-12-07 16:13:16,105 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 21 [2020-12-07 16:13:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:16,105 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2020-12-07 16:13:16,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-07 16:13:16,106 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2020-12-07 16:13:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-07 16:13:16,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:16,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:16,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-07 16:13:16,108 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash -692640299, now seen corresponding path program 1 times [2020-12-07 16:13:16,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:16,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571178917] [2020-12-07 16:13:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:16,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571178917] [2020-12-07 16:13:16,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:16,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-07 16:13:16,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522657412] [2020-12-07 16:13:16,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-07 16:13:16,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-07 16:13:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-07 16:13:16,474 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 3 states. [2020-12-07 16:13:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:16,512 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2020-12-07 16:13:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-07 16:13:16,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-07 16:13:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:16,517 INFO L225 Difference]: With dead ends: 124 [2020-12-07 16:13:16,517 INFO L226 Difference]: Without dead ends: 88 [2020-12-07 16:13:16,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-07 16:13:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-07 16:13:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-12-07 16:13:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-07 16:13:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2020-12-07 16:13:16,549 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 25 [2020-12-07 16:13:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:16,549 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2020-12-07 16:13:16,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-07 16:13:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2020-12-07 16:13:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-07 16:13:16,554 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:16,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:16,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-07 16:13:16,555 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1893417011, now seen corresponding path program 1 times [2020-12-07 16:13:16,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:16,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610591455] [2020-12-07 16:13:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:22,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610591455] [2020-12-07 16:13:22,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:22,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:13:22,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612201848] [2020-12-07 16:13:22,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-07 16:13:22,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-07 16:13:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-07 16:13:22,209 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 10 states. [2020-12-07 16:13:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:25,455 INFO L93 Difference]: Finished difference Result 206 states and 244 transitions. [2020-12-07 16:13:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-07 16:13:25,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-12-07 16:13:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:25,458 INFO L225 Difference]: With dead ends: 206 [2020-12-07 16:13:25,458 INFO L226 Difference]: Without dead ends: 157 [2020-12-07 16:13:25,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2020-12-07 16:13:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-07 16:13:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2020-12-07 16:13:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-07 16:13:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2020-12-07 16:13:25,470 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 25 [2020-12-07 16:13:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:25,471 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2020-12-07 16:13:25,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-07 16:13:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2020-12-07 16:13:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-07 16:13:25,475 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:25,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:25,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-07 16:13:25,476 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1635251573, now seen corresponding path program 1 times [2020-12-07 16:13:25,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:25,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816743456] [2020-12-07 16:13:25,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:26,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816743456] [2020-12-07 16:13:26,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:26,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 16:13:26,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106494017] [2020-12-07 16:13:26,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 16:13:26,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 16:13:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:13:26,027 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 5 states. [2020-12-07 16:13:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:28,394 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2020-12-07 16:13:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 16:13:28,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-07 16:13:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:28,395 INFO L225 Difference]: With dead ends: 173 [2020-12-07 16:13:28,396 INFO L226 Difference]: Without dead ends: 118 [2020-12-07 16:13:28,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-07 16:13:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-07 16:13:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2020-12-07 16:13:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-07 16:13:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2020-12-07 16:13:28,405 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 25 [2020-12-07 16:13:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:28,405 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2020-12-07 16:13:28,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 16:13:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2020-12-07 16:13:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-07 16:13:28,407 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:28,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:28,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-07 16:13:28,408 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:28,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1648598473, now seen corresponding path program 1 times [2020-12-07 16:13:28,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:28,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543591273] [2020-12-07 16:13:28,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:28,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543591273] [2020-12-07 16:13:28,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:28,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 16:13:28,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333211474] [2020-12-07 16:13:28,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 16:13:29,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 16:13:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:13:29,002 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 5 states. [2020-12-07 16:13:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:31,431 INFO L93 Difference]: Finished difference Result 205 states and 240 transitions. [2020-12-07 16:13:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 16:13:31,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-07 16:13:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:31,434 INFO L225 Difference]: With dead ends: 205 [2020-12-07 16:13:31,434 INFO L226 Difference]: Without dead ends: 157 [2020-12-07 16:13:31,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-07 16:13:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-07 16:13:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2020-12-07 16:13:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-07 16:13:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2020-12-07 16:13:31,445 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 25 [2020-12-07 16:13:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:31,445 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2020-12-07 16:13:31,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 16:13:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2020-12-07 16:13:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-07 16:13:31,447 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:31,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:31,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-07 16:13:31,447 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash 968540103, now seen corresponding path program 1 times [2020-12-07 16:13:31,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:31,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080395609] [2020-12-07 16:13:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:32,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080395609] [2020-12-07 16:13:32,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:32,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 16:13:32,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891547418] [2020-12-07 16:13:32,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 16:13:32,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 16:13:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:13:32,080 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand 5 states. [2020-12-07 16:13:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:34,496 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2020-12-07 16:13:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:13:34,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-07 16:13:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:34,500 INFO L225 Difference]: With dead ends: 168 [2020-12-07 16:13:34,501 INFO L226 Difference]: Without dead ends: 119 [2020-12-07 16:13:34,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-07 16:13:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-07 16:13:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2020-12-07 16:13:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-07 16:13:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2020-12-07 16:13:34,510 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 25 [2020-12-07 16:13:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:34,511 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2020-12-07 16:13:34,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 16:13:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2020-12-07 16:13:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-07 16:13:34,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:34,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:34,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-07 16:13:34,513 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash 895707603, now seen corresponding path program 1 times [2020-12-07 16:13:34,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:34,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987639196] [2020-12-07 16:13:34,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:34,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987639196] [2020-12-07 16:13:34,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:34,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 16:13:34,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426606505] [2020-12-07 16:13:34,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 16:13:34,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 16:13:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 16:13:34,798 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand 4 states. [2020-12-07 16:13:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:34,843 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2020-12-07 16:13:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 16:13:34,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-12-07 16:13:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:34,845 INFO L225 Difference]: With dead ends: 153 [2020-12-07 16:13:34,845 INFO L226 Difference]: Without dead ends: 112 [2020-12-07 16:13:34,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:13:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-07 16:13:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-12-07 16:13:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-07 16:13:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2020-12-07 16:13:34,853 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 25 [2020-12-07 16:13:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:34,853 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2020-12-07 16:13:34,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 16:13:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2020-12-07 16:13:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-07 16:13:34,854 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:34,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:34,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-07 16:13:34,855 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash -123775902, now seen corresponding path program 1 times [2020-12-07 16:13:34,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:34,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342609471] [2020-12-07 16:13:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:35,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342609471] [2020-12-07 16:13:35,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:35,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-07 16:13:35,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571550188] [2020-12-07 16:13:35,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-07 16:13:35,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:35,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-07 16:13:35,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-07 16:13:35,480 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 8 states. [2020-12-07 16:13:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:36,127 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2020-12-07 16:13:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-07 16:13:36,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-07 16:13:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:36,130 INFO L225 Difference]: With dead ends: 169 [2020-12-07 16:13:36,131 INFO L226 Difference]: Without dead ends: 165 [2020-12-07 16:13:36,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-07 16:13:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-07 16:13:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 114. [2020-12-07 16:13:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-07 16:13:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2020-12-07 16:13:36,145 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 27 [2020-12-07 16:13:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:36,146 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2020-12-07 16:13:36,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-07 16:13:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2020-12-07 16:13:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-07 16:13:36,147 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:36,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:36,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-07 16:13:36,148 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash -933122528, now seen corresponding path program 1 times [2020-12-07 16:13:36,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:36,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299314238] [2020-12-07 16:13:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:36,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299314238] [2020-12-07 16:13:36,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:36,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 16:13:36,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184631140] [2020-12-07 16:13:36,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 16:13:36,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 16:13:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 16:13:36,648 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 4 states. [2020-12-07 16:13:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:38,916 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2020-12-07 16:13:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 16:13:38,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-12-07 16:13:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:38,918 INFO L225 Difference]: With dead ends: 169 [2020-12-07 16:13:38,919 INFO L226 Difference]: Without dead ends: 117 [2020-12-07 16:13:38,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:13:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-12-07 16:13:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2020-12-07 16:13:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-07 16:13:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2020-12-07 16:13:38,928 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 27 [2020-12-07 16:13:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:38,929 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2020-12-07 16:13:38,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 16:13:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2020-12-07 16:13:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-07 16:13:38,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:38,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:38,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-07 16:13:38,931 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash 192748585, now seen corresponding path program 1 times [2020-12-07 16:13:38,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:38,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609721148] [2020-12-07 16:13:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:43,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609721148] [2020-12-07 16:13:43,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:43,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-07 16:13:43,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292613432] [2020-12-07 16:13:43,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-07 16:13:43,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:43,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-07 16:13:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-07 16:13:43,640 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 7 states. [2020-12-07 16:13:44,070 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-07 16:13:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:44,112 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2020-12-07 16:13:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:13:44,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-12-07 16:13:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:44,117 INFO L225 Difference]: With dead ends: 113 [2020-12-07 16:13:44,117 INFO L226 Difference]: Without dead ends: 111 [2020-12-07 16:13:44,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-07 16:13:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-12-07 16:13:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-12-07 16:13:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-12-07 16:13:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2020-12-07 16:13:44,132 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 36 [2020-12-07 16:13:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:44,133 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2020-12-07 16:13:44,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-07 16:13:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2020-12-07 16:13:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:13:44,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:44,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:44,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-07 16:13:44,138 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:44,139 INFO L82 PathProgramCache]: Analyzing trace with hash 547927563, now seen corresponding path program 1 times [2020-12-07 16:13:44,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:44,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937162105] [2020-12-07 16:13:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:44,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937162105] [2020-12-07 16:13:44,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:44,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-07 16:13:44,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053822565] [2020-12-07 16:13:44,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-07 16:13:44,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:44,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-07 16:13:44,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-07 16:13:44,920 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand 7 states. [2020-12-07 16:13:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:47,525 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2020-12-07 16:13:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:13:47,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-12-07 16:13:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:47,528 INFO L225 Difference]: With dead ends: 144 [2020-12-07 16:13:47,528 INFO L226 Difference]: Without dead ends: 142 [2020-12-07 16:13:47,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-07 16:13:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-07 16:13:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2020-12-07 16:13:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-12-07 16:13:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2020-12-07 16:13:47,538 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 38 [2020-12-07 16:13:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:47,539 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2020-12-07 16:13:47,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-07 16:13:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2020-12-07 16:13:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:13:47,539 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:47,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:47,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-07 16:13:47,540 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash 718836703, now seen corresponding path program 1 times [2020-12-07 16:13:47,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:47,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821346617] [2020-12-07 16:13:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:48,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821346617] [2020-12-07 16:13:48,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:48,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 16:13:48,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682276780] [2020-12-07 16:13:48,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 16:13:48,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 16:13:48,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:13:48,018 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 5 states. [2020-12-07 16:13:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:13:50,437 INFO L93 Difference]: Finished difference Result 276 states and 319 transitions. [2020-12-07 16:13:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 16:13:50,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-07 16:13:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:13:50,441 INFO L225 Difference]: With dead ends: 276 [2020-12-07 16:13:50,441 INFO L226 Difference]: Without dead ends: 200 [2020-12-07 16:13:50,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-07 16:13:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-07 16:13:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2020-12-07 16:13:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-12-07 16:13:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2020-12-07 16:13:50,453 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 38 [2020-12-07 16:13:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:13:50,453 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2020-12-07 16:13:50,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 16:13:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2020-12-07 16:13:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:13:50,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:13:50,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:13:50,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-07 16:13:50,455 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:13:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:13:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1398895073, now seen corresponding path program 1 times [2020-12-07 16:13:50,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:13:50,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096294508] [2020-12-07 16:13:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:13:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:13:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:13:55,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096294508] [2020-12-07 16:13:55,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:13:55,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-07 16:13:55,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125948404] [2020-12-07 16:13:55,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-07 16:13:55,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:13:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-07 16:13:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-12-07 16:13:55,217 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand 12 states. [2020-12-07 16:14:01,880 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-12-07 16:14:02,165 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2020-12-07 16:14:02,350 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2020-12-07 16:14:02,582 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2020-12-07 16:14:02,747 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-12-07 16:14:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:02,999 INFO L93 Difference]: Finished difference Result 225 states and 257 transitions. [2020-12-07 16:14:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-07 16:14:03,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2020-12-07 16:14:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:03,002 INFO L225 Difference]: With dead ends: 225 [2020-12-07 16:14:03,003 INFO L226 Difference]: Without dead ends: 198 [2020-12-07 16:14:03,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2020-12-07 16:14:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-12-07 16:14:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2020-12-07 16:14:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-07 16:14:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2020-12-07 16:14:03,015 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 38 [2020-12-07 16:14:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:03,015 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2020-12-07 16:14:03,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-07 16:14:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2020-12-07 16:14:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:14:03,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:03,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:03,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-07 16:14:03,017 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 806093001, now seen corresponding path program 1 times [2020-12-07 16:14:03,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:03,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812962325] [2020-12-07 16:14:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:03,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812962325] [2020-12-07 16:14:03,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:03,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 16:14:03,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739089374] [2020-12-07 16:14:03,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 16:14:03,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 16:14:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 16:14:03,309 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand 4 states. [2020-12-07 16:14:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:03,466 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2020-12-07 16:14:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 16:14:03,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-07 16:14:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:03,468 INFO L225 Difference]: With dead ends: 217 [2020-12-07 16:14:03,468 INFO L226 Difference]: Without dead ends: 161 [2020-12-07 16:14:03,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:14:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-07 16:14:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2020-12-07 16:14:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-07 16:14:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2020-12-07 16:14:03,482 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 38 [2020-12-07 16:14:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:03,482 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2020-12-07 16:14:03,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 16:14:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2020-12-07 16:14:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:14:03,483 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:03,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:03,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-07 16:14:03,483 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:03,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1657060511, now seen corresponding path program 1 times [2020-12-07 16:14:03,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:03,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957181896] [2020-12-07 16:14:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:06,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957181896] [2020-12-07 16:14:06,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:06,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:14:06,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005713503] [2020-12-07 16:14:06,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:14:06,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:06,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:14:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:14:06,376 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 9 states. [2020-12-07 16:14:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:08,961 INFO L93 Difference]: Finished difference Result 202 states and 229 transitions. [2020-12-07 16:14:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:14:08,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-12-07 16:14:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:08,964 INFO L225 Difference]: With dead ends: 202 [2020-12-07 16:14:08,964 INFO L226 Difference]: Without dead ends: 172 [2020-12-07 16:14:08,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-07 16:14:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-07 16:14:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2020-12-07 16:14:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-12-07 16:14:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2020-12-07 16:14:08,975 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 38 [2020-12-07 16:14:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:08,975 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2020-12-07 16:14:08,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:14:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2020-12-07 16:14:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:14:08,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:08,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:08,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-07 16:14:08,977 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash -34115109, now seen corresponding path program 1 times [2020-12-07 16:14:08,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:08,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073826597] [2020-12-07 16:14:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:14,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073826597] [2020-12-07 16:14:14,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:14,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:14:14,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591201465] [2020-12-07 16:14:14,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:14:14,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:14,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:14:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:14:14,563 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand 9 states. [2020-12-07 16:14:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:17,205 INFO L93 Difference]: Finished difference Result 268 states and 300 transitions. [2020-12-07 16:14:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:14:17,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-12-07 16:14:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:17,208 INFO L225 Difference]: With dead ends: 268 [2020-12-07 16:14:17,209 INFO L226 Difference]: Without dead ends: 173 [2020-12-07 16:14:17,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-07 16:14:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-07 16:14:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2020-12-07 16:14:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-07 16:14:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2020-12-07 16:14:17,222 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 38 [2020-12-07 16:14:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:17,223 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2020-12-07 16:14:17,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:14:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2020-12-07 16:14:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:14:17,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:17,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:17,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-07 16:14:17,225 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1490309383, now seen corresponding path program 1 times [2020-12-07 16:14:17,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:17,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671295054] [2020-12-07 16:14:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:17,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671295054] [2020-12-07 16:14:17,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:17,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 16:14:17,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569657683] [2020-12-07 16:14:17,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 16:14:17,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 16:14:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:14:17,536 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 5 states. [2020-12-07 16:14:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:17,654 INFO L93 Difference]: Finished difference Result 510 states and 579 transitions. [2020-12-07 16:14:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-07 16:14:17,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-07 16:14:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:17,658 INFO L225 Difference]: With dead ends: 510 [2020-12-07 16:14:17,658 INFO L226 Difference]: Without dead ends: 394 [2020-12-07 16:14:17,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-07 16:14:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-12-07 16:14:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 160. [2020-12-07 16:14:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-12-07 16:14:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2020-12-07 16:14:17,675 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 38 [2020-12-07 16:14:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:17,675 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2020-12-07 16:14:17,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 16:14:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2020-12-07 16:14:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-07 16:14:17,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:17,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:17,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-07 16:14:17,677 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:17,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1722457971, now seen corresponding path program 1 times [2020-12-07 16:14:17,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:17,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148398580] [2020-12-07 16:14:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:23,557 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2020-12-07 16:14:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:23,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148398580] [2020-12-07 16:14:23,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:23,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-07 16:14:23,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027470807] [2020-12-07 16:14:23,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-07 16:14:23,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-07 16:14:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-07 16:14:23,798 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand 11 states. [2020-12-07 16:14:26,434 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-12-07 16:14:26,577 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-12-07 16:14:26,758 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2020-12-07 16:14:27,085 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-12-07 16:14:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:27,340 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2020-12-07 16:14:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-07 16:14:27,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2020-12-07 16:14:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:27,344 INFO L225 Difference]: With dead ends: 196 [2020-12-07 16:14:27,344 INFO L226 Difference]: Without dead ends: 162 [2020-12-07 16:14:27,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-07 16:14:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-07 16:14:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2020-12-07 16:14:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-07 16:14:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2020-12-07 16:14:27,356 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 40 [2020-12-07 16:14:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:27,357 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2020-12-07 16:14:27,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-07 16:14:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2020-12-07 16:14:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-07 16:14:27,357 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:27,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:27,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-07 16:14:27,358 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash -147813803, now seen corresponding path program 1 times [2020-12-07 16:14:27,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:27,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011801060] [2020-12-07 16:14:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:27,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011801060] [2020-12-07 16:14:27,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:27,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 16:14:27,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542320412] [2020-12-07 16:14:27,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 16:14:27,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:27,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 16:14:27,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 16:14:27,643 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 4 states. [2020-12-07 16:14:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:27,726 INFO L93 Difference]: Finished difference Result 254 states and 287 transitions. [2020-12-07 16:14:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 16:14:27,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-07 16:14:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:27,730 INFO L225 Difference]: With dead ends: 254 [2020-12-07 16:14:27,730 INFO L226 Difference]: Without dead ends: 142 [2020-12-07 16:14:27,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:14:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-07 16:14:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-12-07 16:14:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-07 16:14:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 159 transitions. [2020-12-07 16:14:27,744 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 159 transitions. Word has length 40 [2020-12-07 16:14:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:27,744 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 159 transitions. [2020-12-07 16:14:27,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 16:14:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 159 transitions. [2020-12-07 16:14:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-07 16:14:27,745 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:27,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:27,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-07 16:14:27,745 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1440534099, now seen corresponding path program 1 times [2020-12-07 16:14:27,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:27,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931179150] [2020-12-07 16:14:27,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:28,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931179150] [2020-12-07 16:14:28,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:28,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:14:28,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948257789] [2020-12-07 16:14:28,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:14:28,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:14:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:14:28,187 INFO L87 Difference]: Start difference. First operand 142 states and 159 transitions. Second operand 9 states. [2020-12-07 16:14:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:30,966 INFO L93 Difference]: Finished difference Result 265 states and 297 transitions. [2020-12-07 16:14:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-07 16:14:30,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-12-07 16:14:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:30,973 INFO L225 Difference]: With dead ends: 265 [2020-12-07 16:14:30,973 INFO L226 Difference]: Without dead ends: 137 [2020-12-07 16:14:30,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-07 16:14:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-12-07 16:14:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-12-07 16:14:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-12-07 16:14:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2020-12-07 16:14:30,992 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 40 [2020-12-07 16:14:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:30,992 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2020-12-07 16:14:30,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:14:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2020-12-07 16:14:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-07 16:14:30,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:30,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:30,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-07 16:14:30,994 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:30,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2110548711, now seen corresponding path program 1 times [2020-12-07 16:14:30,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:30,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112542975] [2020-12-07 16:14:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:35,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112542975] [2020-12-07 16:14:35,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:35,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-07 16:14:35,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134894878] [2020-12-07 16:14:35,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-07 16:14:35,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-07 16:14:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-07 16:14:35,252 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand 7 states. [2020-12-07 16:14:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:37,757 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2020-12-07 16:14:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:14:37,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-07 16:14:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:37,760 INFO L225 Difference]: With dead ends: 223 [2020-12-07 16:14:37,761 INFO L226 Difference]: Without dead ends: 123 [2020-12-07 16:14:37,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-07 16:14:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-07 16:14:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-12-07 16:14:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-07 16:14:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2020-12-07 16:14:37,773 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 41 [2020-12-07 16:14:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:37,773 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2020-12-07 16:14:37,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-07 16:14:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2020-12-07 16:14:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-07 16:14:37,774 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:37,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:37,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-07 16:14:37,775 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash -544849277, now seen corresponding path program 1 times [2020-12-07 16:14:37,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:37,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323672147] [2020-12-07 16:14:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:37,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323672147] [2020-12-07 16:14:37,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:37,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 16:14:37,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970644755] [2020-12-07 16:14:37,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 16:14:37,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 16:14:38,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 16:14:38,004 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 4 states. [2020-12-07 16:14:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:38,109 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2020-12-07 16:14:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 16:14:38,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-07 16:14:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:38,111 INFO L225 Difference]: With dead ends: 194 [2020-12-07 16:14:38,111 INFO L226 Difference]: Without dead ends: 103 [2020-12-07 16:14:38,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:14:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-07 16:14:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-12-07 16:14:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-07 16:14:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2020-12-07 16:14:38,121 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 54 [2020-12-07 16:14:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:38,121 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2020-12-07 16:14:38,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 16:14:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2020-12-07 16:14:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-07 16:14:38,122 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:38,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:38,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-07 16:14:38,123 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1872836840, now seen corresponding path program 1 times [2020-12-07 16:14:38,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:38,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185930762] [2020-12-07 16:14:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:44,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185930762] [2020-12-07 16:14:44,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:44,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:14:44,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850885815] [2020-12-07 16:14:44,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:14:44,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:14:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:14:44,367 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 9 states. [2020-12-07 16:14:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:46,803 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-12-07 16:14:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:14:46,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2020-12-07 16:14:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:46,806 INFO L225 Difference]: With dead ends: 109 [2020-12-07 16:14:46,806 INFO L226 Difference]: Without dead ends: 79 [2020-12-07 16:14:46,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-07 16:14:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-07 16:14:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-07 16:14:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-07 16:14:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-12-07 16:14:46,812 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 60 [2020-12-07 16:14:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:46,813 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-12-07 16:14:46,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:14:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-12-07 16:14:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-07 16:14:46,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:46,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:46,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-07 16:14:46,814 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash 989120274, now seen corresponding path program 1 times [2020-12-07 16:14:46,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:46,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986203860] [2020-12-07 16:14:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:51,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986203860] [2020-12-07 16:14:51,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:51,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:14:51,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110697710] [2020-12-07 16:14:51,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:14:51,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:51,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:14:51,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:14:51,079 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 9 states. [2020-12-07 16:14:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:53,578 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2020-12-07 16:14:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-07 16:14:53,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2020-12-07 16:14:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:53,581 INFO L225 Difference]: With dead ends: 96 [2020-12-07 16:14:53,581 INFO L226 Difference]: Without dead ends: 79 [2020-12-07 16:14:53,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-07 16:14:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-07 16:14:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-07 16:14:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-07 16:14:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2020-12-07 16:14:53,589 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 60 [2020-12-07 16:14:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:53,589 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2020-12-07 16:14:53,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:14:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2020-12-07 16:14:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-07 16:14:53,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:53,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:53,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-07 16:14:53,590 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1664554699, now seen corresponding path program 1 times [2020-12-07 16:14:53,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:53,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805483322] [2020-12-07 16:14:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:14:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:14:56,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805483322] [2020-12-07 16:14:56,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:14:56,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-07 16:14:56,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193795731] [2020-12-07 16:14:56,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-07 16:14:56,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:14:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-07 16:14:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-07 16:14:56,466 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 8 states. [2020-12-07 16:14:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:14:58,900 INFO L93 Difference]: Finished difference Result 89 states and 88 transitions. [2020-12-07 16:14:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-07 16:14:58,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-12-07 16:14:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:14:58,902 INFO L225 Difference]: With dead ends: 89 [2020-12-07 16:14:58,902 INFO L226 Difference]: Without dead ends: 71 [2020-12-07 16:14:58,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-12-07 16:14:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-07 16:14:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-07 16:14:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-07 16:14:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 70 transitions. [2020-12-07 16:14:58,908 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 70 transitions. Word has length 62 [2020-12-07 16:14:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:14:58,908 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 70 transitions. [2020-12-07 16:14:58,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-07 16:14:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 70 transitions. [2020-12-07 16:14:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-07 16:14:58,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:14:58,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:14:58,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-07 16:14:58,909 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:14:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:14:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 688239921, now seen corresponding path program 1 times [2020-12-07 16:14:58,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:14:58,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545904677] [2020-12-07 16:14:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:14:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:15:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:15:00,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545904677] [2020-12-07 16:15:00,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:15:00,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-07 16:15:00,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089904462] [2020-12-07 16:15:00,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-07 16:15:00,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:15:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-07 16:15:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-07 16:15:00,171 INFO L87 Difference]: Start difference. First operand 71 states and 70 transitions. Second operand 8 states. [2020-12-07 16:15:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:15:02,683 INFO L93 Difference]: Finished difference Result 71 states and 70 transitions. [2020-12-07 16:15:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-07 16:15:02,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2020-12-07 16:15:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:15:02,686 INFO L225 Difference]: With dead ends: 71 [2020-12-07 16:15:02,686 INFO L226 Difference]: Without dead ends: 69 [2020-12-07 16:15:02,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-07 16:15:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-07 16:15:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-12-07 16:15:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-07 16:15:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2020-12-07 16:15:02,693 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 66 [2020-12-07 16:15:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:15:02,693 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2020-12-07 16:15:02,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-07 16:15:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2020-12-07 16:15:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-07 16:15:02,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:15:02,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:15:02,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-07 16:15:02,695 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:15:02,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:15:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash -26268109, now seen corresponding path program 1 times [2020-12-07 16:15:02,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:15:02,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178050555] [2020-12-07 16:15:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:15:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:15:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:15:07,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178050555] [2020-12-07 16:15:07,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:15:07,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-07 16:15:07,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801668095] [2020-12-07 16:15:07,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-07 16:15:07,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:15:07,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-07 16:15:07,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-07 16:15:07,069 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 7 states. [2020-12-07 16:15:07,536 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-07 16:15:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:15:07,537 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2020-12-07 16:15:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-07 16:15:07,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-12-07 16:15:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:15:07,538 INFO L225 Difference]: With dead ends: 69 [2020-12-07 16:15:07,539 INFO L226 Difference]: Without dead ends: 0 [2020-12-07 16:15:07,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:15:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-07 16:15:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-07 16:15:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-07 16:15:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-07 16:15:07,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2020-12-07 16:15:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:15:07,541 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-07 16:15:07,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-07 16:15:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-07 16:15:07,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-07 16:15:07,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-07 16:15:07,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-07 16:15:07,744 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 157 [2020-12-07 16:15:08,001 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2020-12-07 16:15:08,888 WARN L197 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2020-12-07 16:15:09,040 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2020-12-07 16:15:09,245 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2020-12-07 16:15:09,370 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2020-12-07 16:15:09,527 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2020-12-07 16:15:09,753 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-12-07 16:15:11,246 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 156 DAG size of output: 73 [2020-12-07 16:15:11,417 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2020-12-07 16:15:12,310 WARN L197 SmtUtils]: Spent 890.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 73 [2020-12-07 16:15:12,320 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,321 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-07 16:15:12,322 INFO L265 CegarLoopResult]: At program point L8757(line 8757) the Hoare annotation is: true [2020-12-07 16:15:12,322 INFO L262 CegarLoopResult]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2020-12-07 16:15:12,322 INFO L262 CegarLoopResult]: For program point L6894(lines 6894 6896) no Hoare annotation was computed. [2020-12-07 16:15:12,324 INFO L258 CegarLoopResult]: At program point L6894-3(lines 6893 6897) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-07 16:15:12,324 INFO L262 CegarLoopResult]: For program point L6894-2(lines 6894 6896) no Hoare annotation was computed. [2020-12-07 16:15:12,325 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:15:12,325 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:15:12,325 INFO L262 CegarLoopResult]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:15:12,325 INFO L262 CegarLoopResult]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:15:12,325 INFO L262 CegarLoopResult]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:15:12,326 INFO L262 CegarLoopResult]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2020-12-07 16:15:12,326 INFO L262 CegarLoopResult]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,326 INFO L262 CegarLoopResult]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2020-12-07 16:15:12,326 INFO L262 CegarLoopResult]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2020-12-07 16:15:12,326 INFO L262 CegarLoopResult]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2020-12-07 16:15:12,326 INFO L262 CegarLoopResult]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,327 INFO L262 CegarLoopResult]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2020-12-07 16:15:12,327 INFO L262 CegarLoopResult]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,327 INFO L262 CegarLoopResult]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2020-12-07 16:15:12,328 INFO L262 CegarLoopResult]: For program point L7159-13(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,329 INFO L258 CegarLoopResult]: At program point L7159-12(lines 7157 7163) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24)) (.cse19 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse1 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse6 (select .cse19 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 16))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse18))) (.cse5 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse7 (= (select .cse19 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| 0))) (.cse10 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse11 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0)) (.cse12 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse13 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse18) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base)) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse16 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 (+ (* 18446744073709551616 (div (+ .cse6 (- 1)) 18446744073709551616)) 18446744073709551615)) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse17 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8))) (and .cse0 .cse1 (<= .cse6 (* 18446744073709551616 (div .cse6 18446744073709551616))) .cse2 .cse3 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse17) 0) .cse4 .cse5 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse17) 0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_aws_byte_buf_init_~capacity (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616))) .cse12 .cse13 .cse14 .cse15 .cse16))))) [2020-12-07 16:15:12,330 INFO L262 CegarLoopResult]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,330 INFO L262 CegarLoopResult]: For program point L7159-17(lines 7159 7160) no Hoare annotation was computed. [2020-12-07 16:15:12,330 INFO L262 CegarLoopResult]: For program point L7159-16(line 7159) no Hoare annotation was computed. [2020-12-07 16:15:12,330 INFO L262 CegarLoopResult]: For program point L7159-14(line 7159) no Hoare annotation was computed. [2020-12-07 16:15:12,330 INFO L262 CegarLoopResult]: For program point L7159-20(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point L7159-19(lines 7159 7160) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L258 CegarLoopResult]: At program point L7159-25(lines 7157 7163) the Hoare annotation is: (let ((.cse9 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (let ((.cse0 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse2 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse7 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse19))) (.cse8 (= (select .cse9 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse10 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| 0))) (.cse12 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse13 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse14 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse19) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base)) (.cse15 (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0))) (.cse16 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse17 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (select .cse9 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 16))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 16)))) (+ (* 18446744073709551616 (div (+ ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (* .cse18 (- 1))) 18446744073709551616)) .cse18))) .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (<= ULTIMATE.start_aws_byte_buf_init_~capacity (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616))) .cse13 .cse14 .cse15 .cse16 .cse17)))) [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point L7159-24(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point L7159-22(lines 7159 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,331 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,332 INFO L262 CegarLoopResult]: For program point L223-6(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,332 INFO L258 CegarLoopResult]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse19 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse6 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse18))) (.cse10 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616))) (.cse2 (select .cse19 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 16))) (.cse7 (= (select .cse19 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse13 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse14 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse18) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base)) (.cse16 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse17 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| 0))) (.cse1 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse9 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse11 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse15 (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)))) (or (let ((.cse5 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8))) (and .cse0 .cse1 (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))) .cse3 .cse4 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse5) 0) .cse6 .cse7 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse5) 0) .cse8 .cse9 (<= ULTIMATE.start_aws_byte_buf_init_~capacity .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse0 .cse1 .cse3 .cse4 .cse6 (< .cse10 ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse2) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res| 1) 0) .cse8 .cse1 .cse9 .cse11 .cse4 .cse15)))) [2020-12-07 16:15:12,332 INFO L262 CegarLoopResult]: For program point L223-7(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,332 INFO L262 CegarLoopResult]: For program point L223-9(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,332 INFO L262 CegarLoopResult]: For program point L223-10(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,332 INFO L262 CegarLoopResult]: For program point L223-12(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,332 INFO L262 CegarLoopResult]: For program point L223-13(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,332 INFO L258 CegarLoopResult]: At program point L6880(lines 6876 6881) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L258 CegarLoopResult]: At program point L6931(lines 6922 6932) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616) 18446744073709551616) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162-12(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,333 INFO L262 CegarLoopResult]: For program point L7162-11(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L7162-9(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L7162-15(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L7162-13(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L7162-17(line 7162) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L210-1(lines 7114 7116) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2020-12-07 16:15:12,334 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-07 16:15:12,335 INFO L262 CegarLoopResult]: For program point L211-6(line 211) no Hoare annotation was computed. [2020-12-07 16:15:12,336 INFO L262 CegarLoopResult]: For program point L211-8(line 211) no Hoare annotation was computed. [2020-12-07 16:15:12,336 INFO L258 CegarLoopResult]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-07 16:15:12,336 INFO L258 CegarLoopResult]: At program point L6884-1(lines 6883 6885) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-07 16:15:12,336 INFO L258 CegarLoopResult]: At program point L6884(lines 6883 6885) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| 0)) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) [2020-12-07 16:15:12,336 INFO L262 CegarLoopResult]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2020-12-07 16:15:12,336 INFO L262 CegarLoopResult]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2020-12-07 16:15:12,336 INFO L262 CegarLoopResult]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2020-12-07 16:15:12,337 INFO L258 CegarLoopResult]: At program point L6919(lines 6917 6920) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-07 16:15:12,337 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-07 16:15:12,337 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:15:12,337 INFO L258 CegarLoopResult]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= ULTIMATE.start_aws_mem_acquire_~mem~0.base 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_mem_acquire_~mem~0.offset 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616) 18446744073709551616) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-07 16:15:12,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,369 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,373 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,374 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,375 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,375 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,381 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,387 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,390 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,391 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,409 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,423 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,424 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,424 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,432 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,437 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,438 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,438 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,438 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:12,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:12,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:15:12 BoogieIcfgContainer [2020-12-07 16:15:12,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-07 16:15:12,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-07 16:15:12,457 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-07 16:15:12,457 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-07 16:15:12,458 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:13:12" (3/4) ... [2020-12-07 16:15:12,462 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-07 16:15:12,489 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2020-12-07 16:15:12,491 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2020-12-07 16:15:12,493 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2020-12-07 16:15:12,495 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-07 16:15:12,497 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-07 16:15:12,499 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-07 16:15:12,501 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-07 16:15:12,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-07 16:15:12,544 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf + 16] / 18446744073709551616)) && buf == buf) && buf == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && buf == 0) && buf == 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity) || ((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && buf == buf) && buf == 0) && allocator == #memory_$Pointer$[buf][buf + 24]) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && buf == 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity)) || ((((((\result + 1 <= 0 && !(buf == 0)) && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && buf == 0) && !(buf == 0)) [2020-12-07 16:15:12,546 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && buf == buf) && 1 <= \result) && allocator == #memory_$Pointer$[buf][buf + 24]) && \result <= 1) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf + 16] + -1) / 18446744073709551616) + 18446744073709551615) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == 0) && allocator == allocator) && capacity == capacity) || (((((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf + 16] / 18446744073709551616)) && buf == buf) && 1 <= \result) && #memory_$Pointer$[buf][buf + 8] == 0) && allocator == #memory_$Pointer$[buf][buf + 24]) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == 0) && allocator == allocator) && capacity == capacity) [2020-12-07 16:15:12,548 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((buf == buf && buf == buf) && 0 <= s_can_fail_allocator_static) && 1 <= \result) && buf == buf) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity) || ((((((((((((((((((capacity <= 18446744073709551616 * ((capacity + unknown-#memory_int-unknown[buf][buf + 16] * -1) / 18446744073709551616) + unknown-#memory_int-unknown[buf][buf + 16] && buf == buf) && buf == buf) && 0 <= s_can_fail_allocator_static) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity) [2020-12-07 16:15:13,691 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-07 16:15:13,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-07 16:15:13,694 INFO L168 Benchmark]: Toolchain (without parser) took 137045.91 ms. Allocated memory was 46.1 MB in the beginning and 1.5 GB in the end (delta: 1.5 GB). Free memory was 21.5 MB in the beginning and 905.2 MB in the end (delta: -883.6 MB). Peak memory consumption was 969.8 MB. Max. memory is 16.1 GB. [2020-12-07 16:15:13,694 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 37.7 MB. Free memory is still 20.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-07 16:15:13,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 4998.51 ms. Allocated memory was 46.1 MB in the beginning and 146.8 MB in the end (delta: 100.7 MB). Free memory was 21.2 MB in the beginning and 94.4 MB in the end (delta: -73.2 MB). Peak memory consumption was 73.7 MB. Max. memory is 16.1 GB. [2020-12-07 16:15:13,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 314.23 ms. Allocated memory is still 146.8 MB. Free memory was 94.4 MB in the beginning and 82.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-07 16:15:13,695 INFO L168 Benchmark]: Boogie Preprocessor took 171.69 ms. Allocated memory is still 146.8 MB. Free memory was 82.9 MB in the beginning and 75.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-07 16:15:13,696 INFO L168 Benchmark]: RCFGBuilder took 10803.99 ms. Allocated memory was 146.8 MB in the beginning and 388.0 MB in the end (delta: 241.2 MB). Free memory was 75.5 MB in the beginning and 176.9 MB in the end (delta: -101.3 MB). Peak memory consumption was 218.5 MB. Max. memory is 16.1 GB. [2020-12-07 16:15:13,696 INFO L168 Benchmark]: TraceAbstraction took 119513.95 ms. Allocated memory was 388.0 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 175.8 MB in the beginning and 836.0 MB in the end (delta: -660.1 MB). Peak memory consumption was 470.2 MB. Max. memory is 16.1 GB. [2020-12-07 16:15:13,696 INFO L168 Benchmark]: Witness Printer took 1234.93 ms. Allocated memory is still 1.5 GB. Free memory was 836.0 MB in the beginning and 905.2 MB in the end (delta: -69.2 MB). Peak memory consumption was 310.4 MB. Max. memory is 16.1 GB. [2020-12-07 16:15:13,699 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.66 ms. Allocated memory is still 37.7 MB. Free memory is still 20.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 4998.51 ms. Allocated memory was 46.1 MB in the beginning and 146.8 MB in the end (delta: 100.7 MB). Free memory was 21.2 MB in the beginning and 94.4 MB in the end (delta: -73.2 MB). Peak memory consumption was 73.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 314.23 ms. Allocated memory is still 146.8 MB. Free memory was 94.4 MB in the beginning and 82.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 171.69 ms. Allocated memory is still 146.8 MB. Free memory was 82.9 MB in the beginning and 75.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10803.99 ms. Allocated memory was 146.8 MB in the beginning and 388.0 MB in the end (delta: 241.2 MB). Free memory was 75.5 MB in the beginning and 176.9 MB in the end (delta: -101.3 MB). Peak memory consumption was 218.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 119513.95 ms. Allocated memory was 388.0 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 175.8 MB in the beginning and 836.0 MB in the end (delta: -660.1 MB). Peak memory consumption was 470.2 MB. Max. memory is 16.1 GB. * Witness Printer took 1234.93 ms. Allocated memory is still 1.5 GB. Free memory was 836.0 MB in the beginning and 905.2 MB in the end (delta: -69.2 MB). Peak memory consumption was 310.4 MB. Max. memory is 16.1 GB. * 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 - 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$.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$.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 - 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && mem == 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && mem == 0) && allocator == allocator) && !(capacity / 18446744073709551616 * 18446744073709551616 == capacity)) && buf == buf) && capacity == capacity - InvariantResult [Line: 7157]: Loop Invariant [2020-12-07 16:15:13,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,712 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,713 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,714 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,714 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,714 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,715 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,717 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && buf == buf) && 1 <= \result) && allocator == #memory_$Pointer$[buf][buf + 24]) && \result <= 1) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf + 16] + -1) / 18446744073709551616) + 18446744073709551615) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == 0) && allocator == allocator) && capacity == capacity) || (((((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf + 16] / 18446744073709551616)) && buf == buf) && 1 <= \result) && #memory_$Pointer$[buf][buf + 8] == 0) && allocator == #memory_$Pointer$[buf][buf + 24]) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == 0) && allocator == allocator) && capacity == capacity) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((buf == buf && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && buf == buf) && capacity == capacity - InvariantResult [Line: 6893]: Loop Invariant Derived loop invariant: ((((((((buf == buf && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && buf == buf) && capacity == capacity - InvariantResult [Line: 6876]: Loop Invariant Derived loop invariant: ((((((((buf == buf && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && buf == buf) && capacity == capacity - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: ((!(buf == 0) && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0 - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: ((((((((buf == buf && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && buf == buf) && capacity == capacity - InvariantResult [Line: 6922]: Loop Invariant Derived loop invariant: ((((((((buf == buf && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && !(capacity / 18446744073709551616 * 18446744073709551616 == capacity)) && buf == buf) && capacity == capacity - InvariantResult [Line: 7157]: Loop Invariant [2020-12-07 16:15:13,723 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,723 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,724 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,724 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((buf == buf && buf == buf) && 0 <= s_can_fail_allocator_static) && 1 <= \result) && buf == buf) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity) || ((((((((((((((((((capacity <= 18446744073709551616 * ((capacity + unknown-#memory_int-unknown[buf][buf + 16] * -1) / 18446744073709551616) + unknown-#memory_int-unknown[buf][buf + 16] && buf == buf) && buf == buf) && 0 <= s_can_fail_allocator_static) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity) - InvariantResult [Line: 6917]: Loop Invariant Derived loop invariant: ((((((((buf == buf && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && buf == buf) && capacity == capacity - InvariantResult [Line: 7110]: Loop Invariant [2020-12-07 16:15:13,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:15:13,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:15:13,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf + 16] / 18446744073709551616)) && buf == buf) && buf == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && buf == 0) && buf == 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity) || ((((((((((((((((buf == buf && 0 <= s_can_fail_allocator_static) && buf == buf) && buf == 0) && allocator == #memory_$Pointer$[buf][buf + 24]) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && buf == 0) && allocator == allocator) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(buf == 0)) && allocator == allocator) && capacity == capacity)) || ((((((\result + 1 <= 0 && !(buf == 0)) && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static <= 0) && buf == 0) && buf == 0) && !(buf == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 114.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 52.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2365 SDtfs, 4859 SDslu, 5861 SDs, 0 SdLazy, 1822 SolverSat, 209 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 44.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=19, 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, 29 MinimizatonAttempts, 636 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 31 NumberOfFragments, 881 HoareAnnotationTreeSize, 12 FomulaSimplifications, 36226 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 38231 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 49.5s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1059 ConstructedInterpolants, 0 QuantifiedInterpolants, 358470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...