./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_byte_cursor_ptr_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 87fd6ee1 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_hash_byte_cursor_ptr_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 84dbdc9a13e8a15a7c27ab966bba7eb071957197 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-87fd6ee [2020-12-04 18:45:34,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 18:45:34,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 18:45:34,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 18:45:34,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 18:45:34,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 18:45:34,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 18:45:34,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 18:45:34,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 18:45:34,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 18:45:34,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 18:45:34,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 18:45:34,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 18:45:34,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 18:45:34,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 18:45:35,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 18:45:35,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 18:45:35,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 18:45:35,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 18:45:35,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 18:45:35,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 18:45:35,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 18:45:35,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 18:45:35,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 18:45:35,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 18:45:35,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 18:45:35,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 18:45:35,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 18:45:35,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 18:45:35,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 18:45:35,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 18:45:35,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 18:45:35,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 18:45:35,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 18:45:35,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 18:45:35,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 18:45:35,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 18:45:35,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 18:45:35,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 18:45:35,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 18:45:35,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 18:45:35,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-04 18:45:35,098 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 18:45:35,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 18:45:35,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 18:45:35,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 18:45:35,102 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 18:45:35,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 18:45:35,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-04 18:45:35,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 18:45:35,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 18:45:35,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 18:45:35,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 18:45:35,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 18:45:35,106 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 18:45:35,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 18:45:35,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 18:45:35,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 18:45:35,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 18:45:35,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:45:35,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 18:45:35,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 18:45:35,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 18:45:35,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-04 18:45:35,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-04 18:45:35,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 18:45:35,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 18:45:35,110 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 -> 84dbdc9a13e8a15a7c27ab966bba7eb071957197 [2020-12-04 18:45:35,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 18:45:35,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 18:45:35,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 18:45:35,638 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 18:45:35,639 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 18:45:35,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_byte_cursor_ptr_harness.i [2020-12-04 18:45:35,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a739094d/615fc3a7c15746bd840f7df0dd62fe91/FLAG1ce339322 [2020-12-04 18:45:37,072 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 18:45:37,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_byte_cursor_ptr_harness.i [2020-12-04 18:45:37,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a739094d/615fc3a7c15746bd840f7df0dd62fe91/FLAG1ce339322 [2020-12-04 18:45:37,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a739094d/615fc3a7c15746bd840f7df0dd62fe91 [2020-12-04 18:45:37,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 18:45:37,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 18:45:37,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 18:45:37,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 18:45:37,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 18:45:37,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:45:37" (1/1) ... [2020-12-04 18:45:37,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3d6222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:37, skipping insertion in model container [2020-12-04 18:45:37,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:45:37" (1/1) ... [2020-12-04 18:45:37,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 18:45:37,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-04 18:45:37,866 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_hash_byte_cursor_ptr_harness.i[4498,4511] [2020-12-04 18:45:37,882 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_hash_byte_cursor_ptr_harness.i[4558,4571] [2020-12-04 18:45:37,921 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:45:37,936 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:45:39,276 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,277 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,278 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,280 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,282 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,303 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,304 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,307 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:39,309 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:40,137 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:45:40,139 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:45:40,140 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:45:40,142 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:45:40,143 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:45:40,144 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:45:40,146 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:45:40,147 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:45:40,147 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:45:40,148 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:45:40,492 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:45:40,756 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:40,757 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,308 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,309 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,337 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,338 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,349 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,350 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,369 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,371 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,372 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,372 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,373 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,374 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,375 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:45:41,471 INFO L203 MainTranslator]: Completed pre-run [2020-12-04 18:45:41,511 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_hash_byte_cursor_ptr_harness.i[4498,4511] [2020-12-04 18:45:41,512 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_hash_byte_cursor_ptr_harness.i[4558,4571] [2020-12-04 18:45:41,514 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:45:41,515 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:45:41,595 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,596 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,597 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,598 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,598 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,610 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,611 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,612 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,613 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,660 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:45:41,661 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:45:41,662 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:45:41,663 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:45:41,664 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:45:41,664 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:45:41,665 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:45:41,666 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:45:41,667 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:45:41,668 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:45:41,714 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:45:41,796 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,799 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,990 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:41,991 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,011 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,012 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,018 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,031 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,044 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,045 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,046 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,046 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,049 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,050 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,051 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:45:42,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:45:43,453 INFO L208 MainTranslator]: Completed translation [2020-12-04 18:45:43,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43 WrapperNode [2020-12-04 18:45:43,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 18:45:43,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 18:45:43,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 18:45:43,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 18:45:43,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 18:45:43,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 18:45:43,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 18:45:43,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 18:45:43,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (1/1) ... [2020-12-04 18:45:43,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 18:45:43,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 18:45:43,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 18:45:43,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 18:45:43,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (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-04 18:45:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-04 18:45:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-04 18:45:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-04 18:45:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 18:45:44,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 18:45:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 18:45:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-04 18:45:44,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-04 18:45:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-04 18:45:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-04 18:45:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-04 18:45:53,545 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !true; [2020-12-04 18:45:53,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 18:45:53,557 INFO L299 CfgBuilder]: Removed 43 assume(true) statements. [2020-12-04 18:45:53,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:45:53 BoogieIcfgContainer [2020-12-04 18:45:53,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 18:45:53,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 18:45:53,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 18:45:53,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 18:45:53,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 06:45:37" (1/3) ... [2020-12-04 18:45:53,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737987c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:45:53, skipping insertion in model container [2020-12-04 18:45:53,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:45:43" (2/3) ... [2020-12-04 18:45:53,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737987c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:45:53, skipping insertion in model container [2020-12-04 18:45:53,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:45:53" (3/3) ... [2020-12-04 18:45:53,573 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_byte_cursor_ptr_harness.i [2020-12-04 18:45:53,595 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 18:45:53,602 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-04 18:45:53,619 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-04 18:45:53,652 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 18:45:53,652 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 18:45:53,653 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 18:45:53,653 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 18:45:53,653 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 18:45:53,653 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 18:45:53,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 18:45:53,654 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 18:45:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2020-12-04 18:45:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-04 18:45:53,698 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:45:53,699 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] [2020-12-04 18:45:53,700 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:45:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:45:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1720806424, now seen corresponding path program 1 times [2020-12-04 18:45:53,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:45:53,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864589021] [2020-12-04 18:45:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:45:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:45:54,733 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-04 18:45:54,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864589021] [2020-12-04 18:45:54,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:45:54,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-04 18:45:54,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035699686] [2020-12-04 18:45:54,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 18:45:54,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:45:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 18:45:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:45:54,782 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 2 states. [2020-12-04 18:45:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:45:54,854 INFO L93 Difference]: Finished difference Result 285 states and 436 transitions. [2020-12-04 18:45:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 18:45:54,856 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-12-04 18:45:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:45:54,875 INFO L225 Difference]: With dead ends: 285 [2020-12-04 18:45:54,875 INFO L226 Difference]: Without dead ends: 139 [2020-12-04 18:45:54,881 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-04 18:45:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-04 18:45:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-04 18:45:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-04 18:45:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2020-12-04 18:45:54,946 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 33 [2020-12-04 18:45:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:45:54,946 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2020-12-04 18:45:54,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 18:45:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2020-12-04 18:45:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-04 18:45:54,949 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:45:54,950 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] [2020-12-04 18:45:54,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-04 18:45:54,950 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:45:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:45:54,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1998426598, now seen corresponding path program 1 times [2020-12-04 18:45:54,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:45:54,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942092869] [2020-12-04 18:45:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:45:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:45:55,496 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-04 18:45:55,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942092869] [2020-12-04 18:45:55,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:45:55,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:45:55,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067603455] [2020-12-04 18:45:55,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:45:55,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:45:55,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:45:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:45:55,504 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand 4 states. [2020-12-04 18:45:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:45:55,653 INFO L93 Difference]: Finished difference Result 257 states and 383 transitions. [2020-12-04 18:45:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:45:55,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-04 18:45:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:45:55,659 INFO L225 Difference]: With dead ends: 257 [2020-12-04 18:45:55,660 INFO L226 Difference]: Without dead ends: 139 [2020-12-04 18:45:55,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:45:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-04 18:45:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-04 18:45:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-04 18:45:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2020-12-04 18:45:55,689 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 33 [2020-12-04 18:45:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:45:55,689 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2020-12-04 18:45:55,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:45:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2020-12-04 18:45:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-04 18:45:55,693 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:45:55,693 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] [2020-12-04 18:45:55,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-04 18:45:55,694 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:45:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:45:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1160971526, now seen corresponding path program 1 times [2020-12-04 18:45:55,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:45:55,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218798556] [2020-12-04 18:45:55,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:45:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:45:56,317 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-04 18:45:56,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218798556] [2020-12-04 18:45:56,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:45:56,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:45:56,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685739284] [2020-12-04 18:45:56,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:45:56,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:45:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:45:56,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:45:56,321 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand 8 states. [2020-12-04 18:45:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:45:56,552 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2020-12-04 18:45:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 18:45:56,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-12-04 18:45:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:45:56,555 INFO L225 Difference]: With dead ends: 160 [2020-12-04 18:45:56,555 INFO L226 Difference]: Without dead ends: 139 [2020-12-04 18:45:56,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-12-04 18:45:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-04 18:45:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-04 18:45:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-04 18:45:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2020-12-04 18:45:56,568 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 37 [2020-12-04 18:45:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:45:56,569 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2020-12-04 18:45:56,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:45:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2020-12-04 18:45:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-04 18:45:56,571 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:45:56,571 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] [2020-12-04 18:45:56,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-04 18:45:56,572 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:45:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:45:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1605875617, now seen corresponding path program 1 times [2020-12-04 18:45:56,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:45:56,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871503991] [2020-12-04 18:45:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:45:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:45:57,532 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-04 18:45:57,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871503991] [2020-12-04 18:45:57,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:45:57,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:45:57,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825048137] [2020-12-04 18:45:57,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:45:57,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:45:57,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:45:57,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:45:57,536 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand 9 states. [2020-12-04 18:46:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:05,631 INFO L93 Difference]: Finished difference Result 310 states and 434 transitions. [2020-12-04 18:46:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:46:05,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2020-12-04 18:46:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:05,635 INFO L225 Difference]: With dead ends: 310 [2020-12-04 18:46:05,636 INFO L226 Difference]: Without dead ends: 276 [2020-12-04 18:46:05,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:46:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-04 18:46:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 173. [2020-12-04 18:46:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-04 18:46:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2020-12-04 18:46:05,655 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 39 [2020-12-04 18:46:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:05,658 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2020-12-04 18:46:05,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:46:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2020-12-04 18:46:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-04 18:46:05,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:05,661 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-04 18:46:05,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-04 18:46:05,661 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:05,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1939046429, now seen corresponding path program 1 times [2020-12-04 18:46:05,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:05,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420749789] [2020-12-04 18:46:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:06,457 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-04 18:46:06,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420749789] [2020-12-04 18:46:06,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:46:06,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:46:06,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576907009] [2020-12-04 18:46:06,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:46:06,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:46:06,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:46:06,461 INFO L87 Difference]: Start difference. First operand 173 states and 242 transitions. Second operand 9 states. [2020-12-04 18:46:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:12,559 INFO L93 Difference]: Finished difference Result 331 states and 454 transitions. [2020-12-04 18:46:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:46:12,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-12-04 18:46:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:12,568 INFO L225 Difference]: With dead ends: 331 [2020-12-04 18:46:12,568 INFO L226 Difference]: Without dead ends: 281 [2020-12-04 18:46:12,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:46:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-12-04 18:46:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 194. [2020-12-04 18:46:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-04 18:46:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2020-12-04 18:46:12,599 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 41 [2020-12-04 18:46:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:12,600 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2020-12-04 18:46:12,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:46:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2020-12-04 18:46:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-04 18:46:12,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:12,606 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] [2020-12-04 18:46:12,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-04 18:46:12,606 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:12,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:12,607 INFO L82 PathProgramCache]: Analyzing trace with hash 883226793, now seen corresponding path program 1 times [2020-12-04 18:46:12,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:12,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696534210] [2020-12-04 18:46:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:13,328 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-04 18:46:13,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696534210] [2020-12-04 18:46:13,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:46:13,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:46:13,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779997989] [2020-12-04 18:46:13,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:46:13,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:46:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:46:13,331 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand 8 states. [2020-12-04 18:46:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:19,177 INFO L93 Difference]: Finished difference Result 377 states and 515 transitions. [2020-12-04 18:46:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:46:19,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-12-04 18:46:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:19,182 INFO L225 Difference]: With dead ends: 377 [2020-12-04 18:46:19,182 INFO L226 Difference]: Without dead ends: 343 [2020-12-04 18:46:19,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:46:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-12-04 18:46:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 201. [2020-12-04 18:46:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-12-04 18:46:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 275 transitions. [2020-12-04 18:46:19,196 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 275 transitions. Word has length 43 [2020-12-04 18:46:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:19,197 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 275 transitions. [2020-12-04 18:46:19,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:46:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 275 transitions. [2020-12-04 18:46:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-04 18:46:19,199 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:19,200 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] [2020-12-04 18:46:19,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-04 18:46:19,200 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash -619864341, now seen corresponding path program 1 times [2020-12-04 18:46:19,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:19,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115464189] [2020-12-04 18:46:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:19,782 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-04 18:46:19,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115464189] [2020-12-04 18:46:19,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:46:19,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:46:19,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831929797] [2020-12-04 18:46:19,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:46:19,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:46:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:46:19,786 INFO L87 Difference]: Start difference. First operand 201 states and 275 transitions. Second operand 8 states. [2020-12-04 18:46:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:25,912 INFO L93 Difference]: Finished difference Result 384 states and 520 transitions. [2020-12-04 18:46:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:46:25,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-12-04 18:46:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:25,916 INFO L225 Difference]: With dead ends: 384 [2020-12-04 18:46:25,917 INFO L226 Difference]: Without dead ends: 334 [2020-12-04 18:46:25,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:46:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-12-04 18:46:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 194. [2020-12-04 18:46:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-04 18:46:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2020-12-04 18:46:25,937 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 45 [2020-12-04 18:46:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:25,938 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2020-12-04 18:46:25,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:46:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2020-12-04 18:46:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-04 18:46:25,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:25,940 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] [2020-12-04 18:46:25,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-04 18:46:25,947 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:25,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1424515361, now seen corresponding path program 1 times [2020-12-04 18:46:25,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:25,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375308084] [2020-12-04 18:46:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:26,678 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-04 18:46:26,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375308084] [2020-12-04 18:46:26,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:46:26,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:46:26,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257659551] [2020-12-04 18:46:26,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:46:26,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:26,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:46:26,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:46:26,681 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand 6 states. [2020-12-04 18:46:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:27,091 INFO L93 Difference]: Finished difference Result 298 states and 395 transitions. [2020-12-04 18:46:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:46:27,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-12-04 18:46:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:27,096 INFO L225 Difference]: With dead ends: 298 [2020-12-04 18:46:27,096 INFO L226 Difference]: Without dead ends: 287 [2020-12-04 18:46:27,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:46:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-04 18:46:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 198. [2020-12-04 18:46:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-12-04 18:46:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 269 transitions. [2020-12-04 18:46:27,110 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 269 transitions. Word has length 47 [2020-12-04 18:46:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:27,110 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 269 transitions. [2020-12-04 18:46:27,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:46:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 269 transitions. [2020-12-04 18:46:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-04 18:46:27,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:27,111 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] [2020-12-04 18:46:27,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-04 18:46:27,112 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash 197741849, now seen corresponding path program 1 times [2020-12-04 18:46:27,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:27,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022104429] [2020-12-04 18:46:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:28,192 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-04 18:46:28,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022104429] [2020-12-04 18:46:28,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:46:28,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:46:28,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515192244] [2020-12-04 18:46:28,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:46:28,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:46:28,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:46:28,195 INFO L87 Difference]: Start difference. First operand 198 states and 269 transitions. Second operand 7 states. [2020-12-04 18:46:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:28,659 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2020-12-04 18:46:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:46:28,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2020-12-04 18:46:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:28,661 INFO L225 Difference]: With dead ends: 390 [2020-12-04 18:46:28,661 INFO L226 Difference]: Without dead ends: 214 [2020-12-04 18:46:28,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:46:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-12-04 18:46:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2020-12-04 18:46:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-12-04 18:46:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 266 transitions. [2020-12-04 18:46:28,673 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 266 transitions. Word has length 51 [2020-12-04 18:46:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:28,673 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 266 transitions. [2020-12-04 18:46:28,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:46:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 266 transitions. [2020-12-04 18:46:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-04 18:46:28,674 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:28,674 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] [2020-12-04 18:46:28,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-04 18:46:28,674 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash -189493142, now seen corresponding path program 1 times [2020-12-04 18:46:28,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:28,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99884525] [2020-12-04 18:46:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:30,057 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-04 18:46:30,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99884525] [2020-12-04 18:46:30,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:46:30,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 18:46:30,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370061169] [2020-12-04 18:46:30,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 18:46:30,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 18:46:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:46:30,061 INFO L87 Difference]: Start difference. First operand 198 states and 266 transitions. Second operand 11 states. [2020-12-04 18:46:46,154 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-04 18:46:47,055 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-04 18:46:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:48,518 INFO L93 Difference]: Finished difference Result 388 states and 514 transitions. [2020-12-04 18:46:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-04 18:46:48,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2020-12-04 18:46:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:48,523 INFO L225 Difference]: With dead ends: 388 [2020-12-04 18:46:48,523 INFO L226 Difference]: Without dead ends: 360 [2020-12-04 18:46:48,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2020-12-04 18:46:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-04 18:46:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 231. [2020-12-04 18:46:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-12-04 18:46:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 314 transitions. [2020-12-04 18:46:48,539 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 314 transitions. Word has length 53 [2020-12-04 18:46:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:48,539 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 314 transitions. [2020-12-04 18:46:48,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 18:46:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 314 transitions. [2020-12-04 18:46:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-04 18:46:48,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:48,541 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-04 18:46:48,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-04 18:46:48,541 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash -921169025, now seen corresponding path program 1 times [2020-12-04 18:46:48,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:48,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147260448] [2020-12-04 18:46:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:46:49,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147260448] [2020-12-04 18:46:49,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344756029] [2020-12-04 18:46:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 18:46:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:50,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 2870 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-04 18:46:50,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 18:46:51,362 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:46:51,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2020-12-04 18:46:51,365 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 18:46:51,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:46:51,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 18:46:51,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2020-12-04 18:46:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:46:51,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-04 18:46:51,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2020-12-04 18:46:51,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154493631] [2020-12-04 18:46:51,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:46:51,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:46:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-04 18:46:51,506 INFO L87 Difference]: Start difference. First operand 231 states and 314 transitions. Second operand 7 states. [2020-12-04 18:46:56,075 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2020-12-04 18:46:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:46:57,539 INFO L93 Difference]: Finished difference Result 446 states and 581 transitions. [2020-12-04 18:46:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:46:57,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-12-04 18:46:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:46:57,543 INFO L225 Difference]: With dead ends: 446 [2020-12-04 18:46:57,543 INFO L226 Difference]: Without dead ends: 345 [2020-12-04 18:46:57,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-12-04 18:46:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-12-04 18:46:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 243. [2020-12-04 18:46:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-12-04 18:46:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 330 transitions. [2020-12-04 18:46:57,560 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 330 transitions. Word has length 54 [2020-12-04 18:46:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:46:57,561 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 330 transitions. [2020-12-04 18:46:57,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:46:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 330 transitions. [2020-12-04 18:46:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-04 18:46:57,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:46:57,562 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] [2020-12-04 18:46:57,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-04 18:46:57,777 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:46:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:46:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash -862761671, now seen corresponding path program 1 times [2020-12-04 18:46:57,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:46:57,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670528898] [2020-12-04 18:46:57,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:46:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:46:59,375 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-04 18:46:59,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670528898] [2020-12-04 18:46:59,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:46:59,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-04 18:46:59,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684975426] [2020-12-04 18:46:59,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-04 18:46:59,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:46:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-04 18:46:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-12-04 18:46:59,379 INFO L87 Difference]: Start difference. First operand 243 states and 330 transitions. Second operand 14 states. [2020-12-04 18:47:14,823 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-12-04 18:47:15,123 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-12-04 18:47:15,407 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-12-04 18:47:15,724 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2020-12-04 18:47:16,145 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2020-12-04 18:47:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:47:18,484 INFO L93 Difference]: Finished difference Result 468 states and 614 transitions. [2020-12-04 18:47:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-04 18:47:18,487 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2020-12-04 18:47:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:47:18,491 INFO L225 Difference]: With dead ends: 468 [2020-12-04 18:47:18,491 INFO L226 Difference]: Without dead ends: 440 [2020-12-04 18:47:18,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2020-12-04 18:47:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-04 18:47:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 317. [2020-12-04 18:47:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-12-04 18:47:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 423 transitions. [2020-12-04 18:47:18,517 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 423 transitions. Word has length 55 [2020-12-04 18:47:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:47:18,517 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 423 transitions. [2020-12-04 18:47:18,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-04 18:47:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2020-12-04 18:47:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-04 18:47:18,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:47:18,519 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] [2020-12-04 18:47:18,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-04 18:47:18,520 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:47:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:47:18,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2055166663, now seen corresponding path program 1 times [2020-12-04 18:47:18,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:47:18,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394229407] [2020-12-04 18:47:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:47:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:47:19,403 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-04 18:47:19,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394229407] [2020-12-04 18:47:19,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:47:19,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:47:19,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057216127] [2020-12-04 18:47:19,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:47:19,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:47:19,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:47:19,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:47:19,410 INFO L87 Difference]: Start difference. First operand 317 states and 423 transitions. Second operand 9 states. [2020-12-04 18:47:24,279 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-12-04 18:47:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:47:27,257 INFO L93 Difference]: Finished difference Result 573 states and 756 transitions. [2020-12-04 18:47:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 18:47:27,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2020-12-04 18:47:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:47:27,266 INFO L225 Difference]: With dead ends: 573 [2020-12-04 18:47:27,267 INFO L226 Difference]: Without dead ends: 535 [2020-12-04 18:47:27,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:47:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-12-04 18:47:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 339. [2020-12-04 18:47:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-12-04 18:47:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 450 transitions. [2020-12-04 18:47:27,292 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 450 transitions. Word has length 55 [2020-12-04 18:47:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:47:27,292 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 450 transitions. [2020-12-04 18:47:27,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:47:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 450 transitions. [2020-12-04 18:47:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-04 18:47:27,294 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:47:27,294 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] [2020-12-04 18:47:27,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-04 18:47:27,295 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:47:27,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:47:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1631519941, now seen corresponding path program 1 times [2020-12-04 18:47:27,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:47:27,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524867425] [2020-12-04 18:47:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:47:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:47:27,895 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-04 18:47:27,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524867425] [2020-12-04 18:47:27,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:47:27,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:47:27,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886892171] [2020-12-04 18:47:27,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:47:27,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:47:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:47:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:47:27,898 INFO L87 Difference]: Start difference. First operand 339 states and 450 transitions. Second operand 7 states. [2020-12-04 18:47:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:47:35,317 INFO L93 Difference]: Finished difference Result 576 states and 768 transitions. [2020-12-04 18:47:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:47:35,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2020-12-04 18:47:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:47:35,324 INFO L225 Difference]: With dead ends: 576 [2020-12-04 18:47:35,325 INFO L226 Difference]: Without dead ends: 538 [2020-12-04 18:47:35,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-12-04 18:47:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-12-04 18:47:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 339. [2020-12-04 18:47:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-12-04 18:47:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 450 transitions. [2020-12-04 18:47:35,355 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 450 transitions. Word has length 55 [2020-12-04 18:47:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:47:35,355 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 450 transitions. [2020-12-04 18:47:35,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:47:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 450 transitions. [2020-12-04 18:47:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-04 18:47:35,357 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:47:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:47:35,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-04 18:47:35,358 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:47:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:47:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2140993031, now seen corresponding path program 1 times [2020-12-04 18:47:35,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:47:35,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319735119] [2020-12-04 18:47:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:47:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:47:39,584 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-04 18:47:39,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319735119] [2020-12-04 18:47:39,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:47:39,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:47:39,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995867831] [2020-12-04 18:47:39,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:47:39,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:47:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:47:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:47:39,587 INFO L87 Difference]: Start difference. First operand 339 states and 450 transitions. Second operand 9 states. [2020-12-04 18:47:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:47:42,945 INFO L93 Difference]: Finished difference Result 668 states and 889 transitions. [2020-12-04 18:47:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:47:42,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2020-12-04 18:47:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:47:42,951 INFO L225 Difference]: With dead ends: 668 [2020-12-04 18:47:42,952 INFO L226 Difference]: Without dead ends: 424 [2020-12-04 18:47:42,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:47:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-12-04 18:47:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 350. [2020-12-04 18:47:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-12-04 18:47:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2020-12-04 18:47:42,978 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 55 [2020-12-04 18:47:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:47:42,978 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2020-12-04 18:47:42,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:47:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2020-12-04 18:47:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-04 18:47:42,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:47:42,981 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] [2020-12-04 18:47:42,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-04 18:47:42,981 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:47:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:47:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1273154468, now seen corresponding path program 1 times [2020-12-04 18:47:42,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:47:42,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964190378] [2020-12-04 18:47:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:47:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:47:48,597 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2020-12-04 18:47:48,769 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-12-04 18:47:48,949 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-12-04 18:47:49,278 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-12-04 18:47:49,483 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2020-12-04 18:47:50,130 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-04 18:47:50,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964190378] [2020-12-04 18:47:50,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:47:50,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-04 18:47:50,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215976521] [2020-12-04 18:47:50,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-04 18:47:50,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:47:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-04 18:47:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-12-04 18:47:50,132 INFO L87 Difference]: Start difference. First operand 350 states and 461 transitions. Second operand 16 states. [2020-12-04 18:48:03,117 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2020-12-04 18:48:03,413 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-12-04 18:48:03,819 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-04 18:48:04,467 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-04 18:48:05,012 WARN L197 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-12-04 18:48:05,816 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-12-04 18:48:06,131 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-04 18:48:06,597 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-04 18:48:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:48:11,936 INFO L93 Difference]: Finished difference Result 606 states and 781 transitions. [2020-12-04 18:48:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-04 18:48:11,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2020-12-04 18:48:11,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:48:11,946 INFO L225 Difference]: With dead ends: 606 [2020-12-04 18:48:11,947 INFO L226 Difference]: Without dead ends: 583 [2020-12-04 18:48:11,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2020-12-04 18:48:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-12-04 18:48:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 359. [2020-12-04 18:48:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-12-04 18:48:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2020-12-04 18:48:11,978 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 58 [2020-12-04 18:48:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:48:11,978 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2020-12-04 18:48:11,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-04 18:48:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2020-12-04 18:48:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-04 18:48:11,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:48:11,981 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] [2020-12-04 18:48:11,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-04 18:48:11,982 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:48:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:48:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1953212838, now seen corresponding path program 1 times [2020-12-04 18:48:11,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:48:11,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217313162] [2020-12-04 18:48:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:48:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:48:13,041 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2020-12-04 18:48:13,741 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-04 18:48:13,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217313162] [2020-12-04 18:48:13,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:48:13,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-04 18:48:13,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398157113] [2020-12-04 18:48:13,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-04 18:48:13,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:48:13,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-04 18:48:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:48:13,746 INFO L87 Difference]: Start difference. First operand 359 states and 472 transitions. Second operand 13 states. [2020-12-04 18:48:28,517 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2020-12-04 18:48:29,020 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-12-04 18:48:29,861 WARN L197 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-12-04 18:48:30,763 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2020-12-04 18:48:33,266 WARN L197 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-12-04 18:48:33,935 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2020-12-04 18:48:34,809 WARN L197 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2020-12-04 18:48:35,670 WARN L197 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2020-12-04 18:48:36,370 WARN L197 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-12-04 18:48:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:48:37,948 INFO L93 Difference]: Finished difference Result 530 states and 687 transitions. [2020-12-04 18:48:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:48:37,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2020-12-04 18:48:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:48:37,958 INFO L225 Difference]: With dead ends: 530 [2020-12-04 18:48:37,958 INFO L226 Difference]: Without dead ends: 503 [2020-12-04 18:48:37,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-12-04 18:48:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-12-04 18:48:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 366. [2020-12-04 18:48:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-12-04 18:48:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 480 transitions. [2020-12-04 18:48:37,996 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 480 transitions. Word has length 58 [2020-12-04 18:48:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:48:37,997 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 480 transitions. [2020-12-04 18:48:37,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-04 18:48:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 480 transitions. [2020-12-04 18:48:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-04 18:48:37,999 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:48:37,999 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] [2020-12-04 18:48:37,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-04 18:48:37,999 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:48:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:48:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1577744605, now seen corresponding path program 1 times [2020-12-04 18:48:38,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:48:38,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237910547] [2020-12-04 18:48:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:48:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:48:39,481 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2020-12-04 18:48:40,375 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-04 18:48:40,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237910547] [2020-12-04 18:48:40,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:48:40,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-04 18:48:40,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707426559] [2020-12-04 18:48:40,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-04 18:48:40,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:48:40,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-04 18:48:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:48:40,379 INFO L87 Difference]: Start difference. First operand 366 states and 480 transitions. Second operand 13 states. [2020-12-04 18:48:53,395 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2020-12-04 18:48:53,944 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-12-04 18:48:54,910 WARN L197 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-12-04 18:48:55,789 WARN L197 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2020-12-04 18:48:57,745 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-12-04 18:48:58,214 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2020-12-04 18:48:58,926 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2020-12-04 18:48:59,887 WARN L197 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-12-04 18:49:00,318 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2020-12-04 18:49:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:49:01,547 INFO L93 Difference]: Finished difference Result 537 states and 695 transitions. [2020-12-04 18:49:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:49:01,552 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2020-12-04 18:49:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:49:01,556 INFO L225 Difference]: With dead ends: 537 [2020-12-04 18:49:01,556 INFO L226 Difference]: Without dead ends: 510 [2020-12-04 18:49:01,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-12-04 18:49:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-12-04 18:49:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 366. [2020-12-04 18:49:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-12-04 18:49:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 480 transitions. [2020-12-04 18:49:01,593 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 480 transitions. Word has length 59 [2020-12-04 18:49:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:49:01,593 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 480 transitions. [2020-12-04 18:49:01,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-04 18:49:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 480 transitions. [2020-12-04 18:49:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-04 18:49:01,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:49:01,595 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] [2020-12-04 18:49:01,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-04 18:49:01,596 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:49:01,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:49:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash 977299011, now seen corresponding path program 1 times [2020-12-04 18:49:01,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:49:01,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568685210] [2020-12-04 18:49:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:49:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:49:06,290 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2020-12-04 18:49:06,533 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-12-04 18:49:06,766 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-12-04 18:49:07,173 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-12-04 18:49:07,361 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2020-12-04 18:49:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:49:08,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568685210] [2020-12-04 18:49:08,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456420284] [2020-12-04 18:49:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 18:49:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:49:09,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 2925 conjuncts, 86 conjunts are in the unsatisfiable core [2020-12-04 18:49:09,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 18:49:10,447 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-04 18:49:10,451 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 18:49:10,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:49:10,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 18:49:10,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-12-04 18:49:11,168 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-12-04 18:49:11,179 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 18:49:11,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:49:11,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-04 18:49:11,296 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2020-12-04 18:49:11,301 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-04 18:49:11,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:49:11,385 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 18:49:11,386 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:18 [2020-12-04 18:49:11,616 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_33|], 1=[|v_#memory_$Pointer$.base_30|]} [2020-12-04 18:49:11,630 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-12-04 18:49:11,633 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 18:49:11,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:49:11,676 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-12-04 18:49:11,680 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-04 18:49:11,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:49:11,706 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 18:49:11,707 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-04 18:49:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-04 18:49:11,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-04 18:49:11,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 26 [2020-12-04 18:49:11,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965926569] [2020-12-04 18:49:11,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-04 18:49:11,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:49:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-04 18:49:11,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2020-12-04 18:49:11,921 INFO L87 Difference]: Start difference. First operand 366 states and 480 transitions. Second operand 14 states. [2020-12-04 18:49:19,693 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-12-04 18:49:20,207 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-04 18:49:20,525 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-04 18:49:20,822 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-04 18:49:21,056 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-04 18:49:21,360 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-04 18:49:21,859 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-04 18:49:22,518 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-04 18:49:22,789 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-04 18:49:23,269 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-04 18:49:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:49:23,939 INFO L93 Difference]: Finished difference Result 533 states and 678 transitions. [2020-12-04 18:49:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-04 18:49:23,947 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2020-12-04 18:49:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:49:23,950 INFO L225 Difference]: With dead ends: 533 [2020-12-04 18:49:23,951 INFO L226 Difference]: Without dead ends: 510 [2020-12-04 18:49:23,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=290, Invalid=1432, Unknown=0, NotChecked=0, Total=1722 [2020-12-04 18:49:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-12-04 18:49:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 448. [2020-12-04 18:49:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-12-04 18:49:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 580 transitions. [2020-12-04 18:49:23,993 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 580 transitions. Word has length 59 [2020-12-04 18:49:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:49:23,994 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 580 transitions. [2020-12-04 18:49:23,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-04 18:49:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 580 transitions. [2020-12-04 18:49:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-04 18:49:23,996 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:49:23,997 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] [2020-12-04 18:49:24,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 18:49:24,213 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:49:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:49:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1657357381, now seen corresponding path program 1 times [2020-12-04 18:49:24,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:49:24,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676459502] [2020-12-04 18:49:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:49:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:49:25,241 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-04 18:49:25,489 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2020-12-04 18:49:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:49:26,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676459502] [2020-12-04 18:49:26,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546093887] [2020-12-04 18:49:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 18:49:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:49:28,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 2920 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-04 18:49:28,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 18:49:28,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 18:49:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-04 18:49:28,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-04 18:49:28,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 15 [2020-12-04 18:49:28,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575120556] [2020-12-04 18:49:28,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:49:28,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:49:28,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:49:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-12-04 18:49:28,734 INFO L87 Difference]: Start difference. First operand 448 states and 580 transitions. Second operand 4 states. [2020-12-04 18:49:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:49:31,951 INFO L93 Difference]: Finished difference Result 699 states and 918 transitions. [2020-12-04 18:49:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:49:31,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-04 18:49:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:49:31,960 INFO L225 Difference]: With dead ends: 699 [2020-12-04 18:49:31,960 INFO L226 Difference]: Without dead ends: 446 [2020-12-04 18:49:31,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-12-04 18:49:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2020-12-04 18:49:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 439. [2020-12-04 18:49:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-12-04 18:49:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 562 transitions. [2020-12-04 18:49:31,998 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 562 transitions. Word has length 59 [2020-12-04 18:49:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:49:31,998 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 562 transitions. [2020-12-04 18:49:31,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:49:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 562 transitions. [2020-12-04 18:49:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-04 18:49:32,000 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:49:32,000 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-04 18:49:32,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 18:49:32,214 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:49:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:49:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash 552863007, now seen corresponding path program 1 times [2020-12-04 18:49:32,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:49:32,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493651793] [2020-12-04 18:49:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:49:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:49:33,112 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2020-12-04 18:49:33,123 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-04 18:49:33,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493651793] [2020-12-04 18:49:33,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:49:33,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:49:33,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967331145] [2020-12-04 18:49:33,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:49:33,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:49:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:49:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:49:33,126 INFO L87 Difference]: Start difference. First operand 439 states and 562 transitions. Second operand 8 states. [2020-12-04 18:49:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:49:35,418 INFO L93 Difference]: Finished difference Result 598 states and 762 transitions. [2020-12-04 18:49:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:49:35,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-12-04 18:49:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:49:35,428 INFO L225 Difference]: With dead ends: 598 [2020-12-04 18:49:35,428 INFO L226 Difference]: Without dead ends: 583 [2020-12-04 18:49:35,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:49:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-12-04 18:49:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 441. [2020-12-04 18:49:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-12-04 18:49:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 563 transitions. [2020-12-04 18:49:35,478 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 563 transitions. Word has length 60 [2020-12-04 18:49:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:49:35,479 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 563 transitions. [2020-12-04 18:49:35,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:49:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 563 transitions. [2020-12-04 18:49:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-04 18:49:35,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:49:35,481 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-04 18:49:35,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-04 18:49:35,482 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:49:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:49:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash -256483619, now seen corresponding path program 1 times [2020-12-04 18:49:35,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:49:35,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028150160] [2020-12-04 18:49:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:49:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:49:36,923 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2020-12-04 18:49:36,932 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-04 18:49:36,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028150160] [2020-12-04 18:49:36,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:49:36,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 18:49:36,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160707902] [2020-12-04 18:49:36,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 18:49:36,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:49:36,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 18:49:36,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:49:36,935 INFO L87 Difference]: Start difference. First operand 441 states and 563 transitions. Second operand 11 states. [2020-12-04 18:49:41,849 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-12-04 18:49:42,583 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-04 18:49:44,326 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-04 18:49:44,723 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-04 18:49:45,027 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-04 18:49:45,325 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-04 18:49:45,591 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-12-04 18:49:45,969 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-12-04 18:49:46,160 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-04 18:49:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:49:46,397 INFO L93 Difference]: Finished difference Result 454 states and 575 transitions. [2020-12-04 18:49:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-04 18:49:46,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-12-04 18:49:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:49:46,406 INFO L225 Difference]: With dead ends: 454 [2020-12-04 18:49:46,407 INFO L226 Difference]: Without dead ends: 114 [2020-12-04 18:49:46,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2020-12-04 18:49:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-04 18:49:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-12-04 18:49:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-04 18:49:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2020-12-04 18:49:46,427 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 60 [2020-12-04 18:49:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:49:46,428 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2020-12-04 18:49:46,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 18:49:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2020-12-04 18:49:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-04 18:49:46,430 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:49:46,430 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] [2020-12-04 18:49:46,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-04 18:49:46,431 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:49:46,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:49:46,432 INFO L82 PathProgramCache]: Analyzing trace with hash -452802390, now seen corresponding path program 1 times [2020-12-04 18:49:46,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:49:46,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609106615] [2020-12-04 18:49:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:49:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:49:47,668 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2020-12-04 18:49:47,812 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-04 18:49:48,063 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-04 18:49:48,264 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-04 18:49:48,980 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-04 18:49:48,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609106615] [2020-12-04 18:49:48,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:49:48,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-04 18:49:48,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143200080] [2020-12-04 18:49:48,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-04 18:49:48,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:49:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-04 18:49:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-12-04 18:49:48,983 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 14 states. [2020-12-04 18:50:04,305 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2020-12-04 18:50:04,596 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2020-12-04 18:50:05,381 WARN L197 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-12-04 18:50:08,229 WARN L197 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-12-04 18:50:09,064 WARN L197 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-12-04 18:50:09,806 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2020-12-04 18:50:10,763 WARN L197 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-12-04 18:50:12,455 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-04 18:50:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:50:12,942 INFO L93 Difference]: Finished difference Result 170 states and 199 transitions. [2020-12-04 18:50:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-04 18:50:12,949 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2020-12-04 18:50:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:50:12,950 INFO L225 Difference]: With dead ends: 170 [2020-12-04 18:50:12,950 INFO L226 Difference]: Without dead ends: 148 [2020-12-04 18:50:12,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2020-12-04 18:50:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-04 18:50:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 114. [2020-12-04 18:50:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-04 18:50:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2020-12-04 18:50:12,960 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 61 [2020-12-04 18:50:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:50:12,960 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2020-12-04 18:50:12,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-04 18:50:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2020-12-04 18:50:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-04 18:50:12,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:50:12,961 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] [2020-12-04 18:50:12,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-04 18:50:12,961 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:50:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:50:12,963 INFO L82 PathProgramCache]: Analyzing trace with hash 599475833, now seen corresponding path program 1 times [2020-12-04 18:50:12,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:50:12,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404352020] [2020-12-04 18:50:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:50:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:50:14,072 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-04 18:50:14,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404352020] [2020-12-04 18:50:14,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:50:14,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:50:14,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269228395] [2020-12-04 18:50:14,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:50:14,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:50:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:50:14,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:50:14,076 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 9 states. [2020-12-04 18:50:18,781 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2020-12-04 18:50:19,120 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2020-12-04 18:50:19,315 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-12-04 18:50:19,926 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-04 18:50:20,136 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2020-12-04 18:50:20,379 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2020-12-04 18:50:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:50:20,483 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2020-12-04 18:50:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 18:50:20,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-12-04 18:50:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:50:20,490 INFO L225 Difference]: With dead ends: 114 [2020-12-04 18:50:20,490 INFO L226 Difference]: Without dead ends: 0 [2020-12-04 18:50:20,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:50:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-04 18:50:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-04 18:50:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-04 18:50:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-04 18:50:20,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2020-12-04 18:50:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:50:20,492 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-04 18:50:20,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:50:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-04 18:50:20,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-04 18:50:20,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-04 18:50:20,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-04 18:50:20,694 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 186 [2020-12-04 18:50:20,979 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 217 [2020-12-04 18:50:21,180 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 191 [2020-12-04 18:50:21,481 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 220 [2020-12-04 18:50:21,807 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 225 [2020-12-04 18:50:21,968 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 155 [2020-12-04 18:50:22,158 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 200 [2020-12-04 18:50:22,338 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 200 [2020-12-04 18:50:22,549 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 190 [2020-12-04 18:50:22,698 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 201 [2020-12-04 18:50:22,884 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 190 [2020-12-04 18:50:23,074 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 176 [2020-12-04 18:50:23,211 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2020-12-04 18:50:24,462 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-12-04 18:50:28,073 WARN L197 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 176 DAG size of output: 92 [2020-12-04 18:50:32,539 WARN L197 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 208 DAG size of output: 100 [2020-12-04 18:50:35,974 WARN L197 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 190 DAG size of output: 81 [2020-12-04 18:50:41,606 WARN L197 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 219 DAG size of output: 103 [2020-12-04 18:50:47,350 WARN L197 SmtUtils]: Spent 5.70 s on a formula simplification. DAG size of input: 223 DAG size of output: 102 [2020-12-04 18:50:51,322 WARN L197 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 148 DAG size of output: 61 [2020-12-04 18:50:54,760 WARN L197 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 196 DAG size of output: 87 [2020-12-04 18:50:58,467 WARN L197 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 196 DAG size of output: 92 [2020-12-04 18:51:02,588 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 184 DAG size of output: 120 [2020-12-04 18:51:06,305 WARN L197 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 199 DAG size of output: 93 [2020-12-04 18:51:10,150 WARN L197 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 184 DAG size of output: 120 [2020-12-04 18:51:12,253 WARN L197 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 174 DAG size of output: 23 [2020-12-04 18:51:12,368 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2020-12-04 18:51:12,374 INFO L262 CegarLoopResult]: For program point L10176(line 10176) no Hoare annotation was computed. [2020-12-04 18:51:12,374 INFO L262 CegarLoopResult]: For program point L10143(line 10143) no Hoare annotation was computed. [2020-12-04 18:51:12,375 INFO L262 CegarLoopResult]: For program point L10176-2(line 10176) no Hoare annotation was computed. [2020-12-04 18:51:12,375 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:51:12,375 INFO L262 CegarLoopResult]: For program point L10177(line 10177) no Hoare annotation was computed. [2020-12-04 18:51:12,375 INFO L262 CegarLoopResult]: For program point L10177-2(line 10177) no Hoare annotation was computed. [2020-12-04 18:51:12,375 INFO L262 CegarLoopResult]: For program point L10178(line 10178) no Hoare annotation was computed. [2020-12-04 18:51:12,375 INFO L262 CegarLoopResult]: For program point L10145(line 10145) no Hoare annotation was computed. [2020-12-04 18:51:12,376 INFO L262 CegarLoopResult]: For program point L10178-2(line 10178) no Hoare annotation was computed. [2020-12-04 18:51:12,376 INFO L262 CegarLoopResult]: For program point L10179(line 10179) no Hoare annotation was computed. [2020-12-04 18:51:12,376 INFO L258 CegarLoopResult]: At program point L11170(lines 11170 11178) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse2 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse10 (select (select |#memory_int| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|)) (.cse4 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse5 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse7 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse8 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse9 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0)))) (or (and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse0 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 4) 0)) .cse1 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse2 .cse3 .cse4 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0) .cse5 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 4) 0)) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0) .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (and .cse5 .cse0 .cse6 .cse1 .cse2 (<= 0 .cse10) .cse3 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0) .cse8 .cse9 (<= .cse10 0) .cse4) (and (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|) .cse0 .cse1 .cse2 .cse3 (<= .cse10 (* 4294967296 (div .cse10 4294967296))) .cse4 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) .cse5 .cse6 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset) .cse7 .cse8 .cse9 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)))) [2020-12-04 18:51:12,377 INFO L262 CegarLoopResult]: For program point L10179-2(line 10179) no Hoare annotation was computed. [2020-12-04 18:51:12,378 INFO L258 CegarLoopResult]: At program point L7405-3(lines 7403 7407) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse3 (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1)) (.cse4 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse9 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|)) (.cse2 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse5 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse7 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 4) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (select .cse6 4) 0) .cse7 (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (<= .cse8 (* 4294967296 (div .cse8 4294967296)))) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse9 .cse10 (not (= (select .cse6 (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0))) (and .cse2 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 0) .cse5 .cse7 .cse10 (<= 0 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)))) [2020-12-04 18:51:12,378 INFO L262 CegarLoopResult]: For program point L7405-2(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,378 INFO L262 CegarLoopResult]: For program point L7405(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,379 INFO L258 CegarLoopResult]: At program point L7405-7(lines 7403 7407) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse0 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse6 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse2 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse3 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse8 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse5 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse7 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse9 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset))) (or (and .cse0 .cse1 .cse2 (= (select |#valid| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 1) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0) .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 4) 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) .cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse6 .cse7) (and .cse1 .cse4 .cse0 .cse3 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1) .cse8 .cse5 .cse6 .cse7 (<= .cse9 (* 4294967296 (div .cse9 4294967296))) .cse2) (let ((.cse10 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (and .cse3 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 0) (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0)) .cse8 .cse5 (<= .cse9 .cse10) .cse7 (<= 0 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) (<= .cse10 .cse9))))) [2020-12-04 18:51:12,379 INFO L262 CegarLoopResult]: For program point L7405-6(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,379 INFO L262 CegarLoopResult]: For program point L10180(line 10180) no Hoare annotation was computed. [2020-12-04 18:51:12,379 INFO L262 CegarLoopResult]: For program point L7405-4(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,379 INFO L262 CegarLoopResult]: For program point L10180-2(line 10180) no Hoare annotation was computed. [2020-12-04 18:51:12,380 INFO L258 CegarLoopResult]: At program point L7405-11(lines 7403 7407) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse2 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse3 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse6 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse7 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse8 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse9 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse10 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|))) (or (and (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|) .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (<= .cse5 (* 4294967296 (div .cse5 4294967296)))) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset) .cse9 .cse10 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 4) 0)) .cse1 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse2 .cse4 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) .cse6 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0) (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse8 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 4) 0)) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) .cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (let ((.cse12 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|)) (.cse11 (select (select (let ((.cse13 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse13 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse13 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (<= .cse11 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse11) .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|)) .cse4 (<= .cse12 0) .cse6 .cse7 .cse8 (<= 0 .cse12) .cse9 (or (and (<= 0 .cse11) (<= .cse11 0)) (not |ULTIMATE.start_hashlittle2_#t~switch1525|)) .cse10)))) [2020-12-04 18:51:12,381 INFO L262 CegarLoopResult]: For program point L7405-10(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,381 INFO L262 CegarLoopResult]: For program point L7405-8(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,381 INFO L258 CegarLoopResult]: At program point L7405-15(lines 7403 7407) the Hoare annotation is: (and (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0) (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) [2020-12-04 18:51:12,381 INFO L262 CegarLoopResult]: For program point L7405-14(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,381 INFO L262 CegarLoopResult]: For program point L7405-12(lines 7405 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,382 INFO L262 CegarLoopResult]: For program point L7406(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,382 INFO L262 CegarLoopResult]: For program point L7406-4(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,382 INFO L262 CegarLoopResult]: For program point L7406-2(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,382 INFO L262 CegarLoopResult]: For program point L7406-8(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,382 INFO L262 CegarLoopResult]: For program point L10181(line 10181) no Hoare annotation was computed. [2020-12-04 18:51:12,382 INFO L262 CegarLoopResult]: For program point L7406-6(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,383 INFO L262 CegarLoopResult]: For program point L10181-2(line 10181) no Hoare annotation was computed. [2020-12-04 18:51:12,383 INFO L262 CegarLoopResult]: For program point L7406-5(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,383 INFO L262 CegarLoopResult]: For program point L7406-12(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,383 INFO L262 CegarLoopResult]: For program point L7406-11(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,383 INFO L262 CegarLoopResult]: For program point L7406-10(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,383 INFO L262 CegarLoopResult]: For program point L7406-16(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,384 INFO L262 CegarLoopResult]: For program point L7406-14(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,384 INFO L262 CegarLoopResult]: For program point L7406-20(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,384 INFO L262 CegarLoopResult]: For program point L7406-18(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,384 INFO L262 CegarLoopResult]: For program point L7406-17(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,384 INFO L262 CegarLoopResult]: For program point L7406-24(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,384 INFO L262 CegarLoopResult]: For program point L7406-23(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,385 INFO L262 CegarLoopResult]: For program point L7406-22(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,385 INFO L262 CegarLoopResult]: For program point L7406-28(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,385 INFO L262 CegarLoopResult]: For program point L7406-26(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,385 INFO L262 CegarLoopResult]: For program point L7406-32(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,385 INFO L262 CegarLoopResult]: For program point L7406-30(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,385 INFO L262 CegarLoopResult]: For program point L7406-29(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,386 INFO L262 CegarLoopResult]: For program point L7406-36(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,386 INFO L262 CegarLoopResult]: For program point L7406-35(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,386 INFO L262 CegarLoopResult]: For program point L7406-34(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,386 INFO L262 CegarLoopResult]: For program point L7406-40(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,386 INFO L262 CegarLoopResult]: For program point L10182-2(line 10182) no Hoare annotation was computed. [2020-12-04 18:51:12,386 INFO L262 CegarLoopResult]: For program point L7406-38(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,386 INFO L262 CegarLoopResult]: For program point L7406-44(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,387 INFO L262 CegarLoopResult]: For program point L7406-42(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,387 INFO L262 CegarLoopResult]: For program point L10182(line 10182) no Hoare annotation was computed. [2020-12-04 18:51:12,387 INFO L262 CegarLoopResult]: For program point L7406-41(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,387 INFO L262 CegarLoopResult]: For program point L7406-47(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,387 INFO L262 CegarLoopResult]: For program point L7406-46(line 7406) no Hoare annotation was computed. [2020-12-04 18:51:12,387 INFO L262 CegarLoopResult]: For program point L10183-2(line 10183) no Hoare annotation was computed. [2020-12-04 18:51:12,388 INFO L258 CegarLoopResult]: At program point L10084(lines 10084 10099) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse0 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse2 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1)) (.cse4 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse5 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse7 (= (select |#valid| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 1)) (.cse8 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse10 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse9 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse11 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse12 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse13 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) .cse7 .cse8 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse9 .cse10 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0) .cse11 .cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse13) (let ((.cse14 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|))) (and (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|) .cse1 (or (<= 2287612045 ULTIMATE.start_hashlittle2_~length) (not .cse14)) .cse0 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse5 .cse6 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse7 .cse8 .cse10 .cse9 (or (let ((.cse15 (select (select (let ((.cse16 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse16 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse16 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (<= .cse15 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse15))) .cse14) .cse11 .cse12 (not |ULTIMATE.start_hashlittle2_#t~switch1525|) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) .cse13 (let ((.cse17 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset))) (<= .cse17 (* 4294967296 (div .cse17 4294967296)))))))) [2020-12-04 18:51:12,388 INFO L262 CegarLoopResult]: For program point L10183(line 10183) no Hoare annotation was computed. [2020-12-04 18:51:12,389 INFO L262 CegarLoopResult]: For program point L11340(lines 11340 11351) no Hoare annotation was computed. [2020-12-04 18:51:12,389 INFO L262 CegarLoopResult]: For program point L10184(line 10184) no Hoare annotation was computed. [2020-12-04 18:51:12,389 INFO L258 CegarLoopResult]: At program point L10118(lines 10118 10146) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse2 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse3 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1)) (.cse5 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse6 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse8 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse7 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse11 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse12 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse13 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse15 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (let ((.cse1 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|))) (and (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|) .cse0 (or (<= 2287612045 ULTIMATE.start_hashlittle2_~length) (not .cse1)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse5 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse6 .cse7 .cse8 (or (let ((.cse9 (select (select (let ((.cse10 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse10 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse10 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (<= .cse9 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse9))) .cse1) .cse11 .cse12 .cse13 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (let ((.cse14 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset))) (<= .cse14 (* 4294967296 (div .cse14 4294967296)))) .cse15)) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) .cse6 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse8 .cse7 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0) .cse11 .cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse13 .cse15))) [2020-12-04 18:51:12,390 INFO L262 CegarLoopResult]: For program point L10184-2(line 10184) no Hoare annotation was computed. [2020-12-04 18:51:12,390 INFO L262 CegarLoopResult]: For program point L10152-3(lines 10152 10169) no Hoare annotation was computed. [2020-12-04 18:51:12,390 INFO L262 CegarLoopResult]: For program point L10185(line 10185) no Hoare annotation was computed. [2020-12-04 18:51:12,390 INFO L262 CegarLoopResult]: For program point L10086(line 10086) no Hoare annotation was computed. [2020-12-04 18:51:12,391 INFO L258 CegarLoopResult]: At program point L10152-2(lines 10152 10169) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse2 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse3 (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1)) (.cse4 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse6 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse8 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse7 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse11 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0)) (.cse12 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse13 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (let ((.cse1 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|))) (and .cse0 (or (<= 2287612045 ULTIMATE.start_hashlittle2_~length) (not .cse1)) .cse2 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) .cse3 .cse4 (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse5 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) (= (mod ULTIMATE.start_hashlittle2_~length 4294967296) 0) .cse6 .cse7 .cse8 (or (let ((.cse9 (select (select (let ((.cse10 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse10 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse10 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (<= .cse9 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse9))) .cse1) .cse11 .cse12 .cse13 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (let ((.cse14 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset))) (<= .cse14 (* 4294967296 (div .cse14 4294967296)))))) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_hashlittle2_~pb.offset 0) .cse6 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0) (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse8 .cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 4) 0)) .cse11 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) .cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse13))) [2020-12-04 18:51:12,391 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:51:12,391 INFO L262 CegarLoopResult]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:51:12,391 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:51:12,391 INFO L262 CegarLoopResult]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:51:12,392 INFO L262 CegarLoopResult]: For program point L10120(line 10120) no Hoare annotation was computed. [2020-12-04 18:51:12,392 INFO L262 CegarLoopResult]: For program point L10087(line 10087) no Hoare annotation was computed. [2020-12-04 18:51:12,392 INFO L262 CegarLoopResult]: For program point L11177-3(line 11177) no Hoare annotation was computed. [2020-12-04 18:51:12,393 INFO L258 CegarLoopResult]: At program point L10054(lines 10054 10193) the Hoare annotation is: (let ((.cse13 (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base))) (let ((.cse1 (not |ULTIMATE.start_hashlittle2_#t~switch1525|)) (.cse14 (select (let ((.cse24 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse24 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse24 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) (.cse17 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse18 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse15 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse16 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse21 (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base))) (.cse20 (select .cse13 ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset)) (.cse19 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse22 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)))) (let ((.cse4 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse8 (or (let ((.cse23 (select .cse14 ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset))) (and .cse17 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0) .cse18 (or (<= 2287612045 ULTIMATE.start_hashlittle2_~length) (and (<= ULTIMATE.start_hashlittle2_~length .cse23) (<= .cse23 ULTIMATE.start_hashlittle2_~length))) (<= 0 .cse20) .cse15 .cse19 (<= .cse20 0) (or (and (<= .cse23 0) (<= 0 .cse23)) .cse1))) (and .cse17 .cse18 .cse15 .cse16 .cse21 (<= .cse20 (* 4294967296 (div .cse20 4294967296))) .cse19 .cse22))) (.cse9 (or (<= 13 ULTIMATE.start_hashlittle2_~length) (and (<= .cse20 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse20) .cse21 .cse22))) (.cse11 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|)) (.cse3 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse2 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse5 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse7 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse10 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse12 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (let ((.cse0 (select .cse14 |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|)) (.cse6 (select .cse13 |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (or (<= .cse0 0) .cse1) (<= .cse0 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse0) .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|)) (<= .cse6 0) .cse7 .cse8 .cse9 (<= 0 .cse6) .cse10 .cse11 .cse12)) (and (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|) .cse2 .cse7 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5) (and .cse3 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse2 .cse15 .cse16 .cse5 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) .cse17 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse18 .cse7 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) .cse19 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse10 .cse12))))) [2020-12-04 18:51:12,394 INFO L258 CegarLoopResult]: At program point L11177-2(line 11177) the Hoare annotation is: (let ((.cse13 (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base))) (let ((.cse1 (not |ULTIMATE.start_hashlittle2_#t~switch1525|)) (.cse14 (select (let ((.cse24 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse24 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse24 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) (.cse17 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse18 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse15 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse16 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse21 (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base))) (.cse20 (select .cse13 ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset)) (.cse19 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse22 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)))) (let ((.cse4 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse8 (or (let ((.cse23 (select .cse14 ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset))) (and .cse17 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0) .cse18 (or (<= 2287612045 ULTIMATE.start_hashlittle2_~length) (and (<= ULTIMATE.start_hashlittle2_~length .cse23) (<= .cse23 ULTIMATE.start_hashlittle2_~length))) (<= 0 .cse20) .cse15 .cse19 (<= .cse20 0) (or (and (<= .cse23 0) (<= 0 .cse23)) .cse1))) (and .cse17 .cse18 .cse15 .cse16 .cse21 (<= .cse20 (* 4294967296 (div .cse20 4294967296))) .cse19 .cse22))) (.cse9 (or (<= 13 ULTIMATE.start_hashlittle2_~length) (and (<= .cse20 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse20) .cse21 .cse22))) (.cse11 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|)) (.cse3 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse2 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse5 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse7 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse10 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse12 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (let ((.cse0 (select .cse14 |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|)) (.cse6 (select .cse13 |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (or (<= .cse0 0) .cse1) (<= .cse0 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse0) .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|)) (<= .cse6 0) .cse7 .cse8 .cse9 (<= 0 .cse6) .cse10 .cse11 .cse12)) (and (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|) .cse2 .cse7 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5) (and .cse3 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse2 .cse15 .cse16 .cse5 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) .cse17 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse18 .cse7 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) .cse19 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse10 .cse12))))) [2020-12-04 18:51:12,394 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-04 18:51:12,394 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-04 18:51:12,395 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-04 18:51:12,395 INFO L262 CegarLoopResult]: For program point L10187(line 10187) no Hoare annotation was computed. [2020-12-04 18:51:12,395 INFO L262 CegarLoopResult]: For program point L211-6(line 211) no Hoare annotation was computed. [2020-12-04 18:51:12,395 INFO L262 CegarLoopResult]: For program point L10088(line 10088) no Hoare annotation was computed. [2020-12-04 18:51:12,395 INFO L262 CegarLoopResult]: For program point L10089(line 10089) no Hoare annotation was computed. [2020-12-04 18:51:12,395 INFO L262 CegarLoopResult]: For program point L10090(line 10090) no Hoare annotation was computed. [2020-12-04 18:51:12,396 INFO L262 CegarLoopResult]: For program point L10124(line 10124) no Hoare annotation was computed. [2020-12-04 18:51:12,396 INFO L262 CegarLoopResult]: For program point L10091(line 10091) no Hoare annotation was computed. [2020-12-04 18:51:12,396 INFO L262 CegarLoopResult]: For program point L10124-2(line 10124) no Hoare annotation was computed. [2020-12-04 18:51:12,396 INFO L262 CegarLoopResult]: For program point L10125(line 10125) no Hoare annotation was computed. [2020-12-04 18:51:12,396 INFO L262 CegarLoopResult]: For program point L10092(line 10092) no Hoare annotation was computed. [2020-12-04 18:51:12,396 INFO L262 CegarLoopResult]: For program point L10093(line 10093) no Hoare annotation was computed. [2020-12-04 18:51:12,396 INFO L262 CegarLoopResult]: For program point L10094(line 10094) no Hoare annotation was computed. [2020-12-04 18:51:12,397 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-04 18:51:12,397 INFO L262 CegarLoopResult]: For program point L10095(line 10095) no Hoare annotation was computed. [2020-12-04 18:51:12,397 INFO L262 CegarLoopResult]: For program point L10129(line 10129) no Hoare annotation was computed. [2020-12-04 18:51:12,397 INFO L262 CegarLoopResult]: For program point L10096(line 10096) no Hoare annotation was computed. [2020-12-04 18:51:12,397 INFO L262 CegarLoopResult]: For program point L10129-2(line 10129) no Hoare annotation was computed. [2020-12-04 18:51:12,397 INFO L262 CegarLoopResult]: For program point L10130(line 10130) no Hoare annotation was computed. [2020-12-04 18:51:12,398 INFO L265 CegarLoopResult]: At program point L11352(line 11352) the Hoare annotation is: true [2020-12-04 18:51:12,398 INFO L262 CegarLoopResult]: For program point L10097(line 10097) no Hoare annotation was computed. [2020-12-04 18:51:12,398 INFO L262 CegarLoopResult]: For program point L10098(line 10098) no Hoare annotation was computed. [2020-12-04 18:51:12,398 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:51:12,398 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:51:12,399 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-04 18:51:12,399 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-04 18:51:12,399 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-04 18:51:12,399 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-04 18:51:12,399 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-04 18:51:12,399 INFO L262 CegarLoopResult]: For program point L10133(line 10133) no Hoare annotation was computed. [2020-12-04 18:51:12,400 INFO L262 CegarLoopResult]: For program point L10133-2(line 10133) no Hoare annotation was computed. [2020-12-04 18:51:12,400 INFO L262 CegarLoopResult]: For program point L10068(line 10068) no Hoare annotation was computed. [2020-12-04 18:51:12,400 INFO L262 CegarLoopResult]: For program point L10068-2(lines 10068 10189) no Hoare annotation was computed. [2020-12-04 18:51:12,400 INFO L262 CegarLoopResult]: For program point L10134(line 10134) no Hoare annotation was computed. [2020-12-04 18:51:12,400 INFO L262 CegarLoopResult]: For program point L10102-2(lines 10102 10189) no Hoare annotation was computed. [2020-12-04 18:51:12,400 INFO L262 CegarLoopResult]: For program point L10102-4(lines 10068 10189) no Hoare annotation was computed. [2020-12-04 18:51:12,401 INFO L258 CegarLoopResult]: At program point L6898(lines 6894 6899) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) [2020-12-04 18:51:12,401 INFO L262 CegarLoopResult]: For program point L10102(line 10102) no Hoare annotation was computed. [2020-12-04 18:51:12,401 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-04 18:51:12,401 INFO L262 CegarLoopResult]: For program point L10137(line 10137) no Hoare annotation was computed. [2020-12-04 18:51:12,402 INFO L262 CegarLoopResult]: For program point L10137-2(line 10137) no Hoare annotation was computed. [2020-12-04 18:51:12,402 INFO L258 CegarLoopResult]: At program point L6669(lines 6667 6670) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1) (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) [2020-12-04 18:51:12,402 INFO L258 CegarLoopResult]: At program point L261(line 261) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0)) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) [2020-12-04 18:51:12,402 INFO L262 CegarLoopResult]: For program point L10138(line 10138) no Hoare annotation was computed. [2020-12-04 18:51:12,403 INFO L262 CegarLoopResult]: For program point L10072-3(lines 10072 10080) no Hoare annotation was computed. [2020-12-04 18:51:12,403 INFO L258 CegarLoopResult]: At program point L10072-2(lines 10072 10080) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse0 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse3 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse4 (= (select |#valid| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 1)) (.cse5 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0)) (.cse7 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse6 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse10 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0)) (.cse11 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0))) (.cse13 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (let ((.cse2 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|))) (and .cse0 .cse1 (or (<= 2287612045 ULTIMATE.start_hashlittle2_~length) (not .cse2)) (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse3 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) (= (mod ULTIMATE.start_hashlittle2_~length 4294967296) 0) .cse4 .cse5 .cse6 .cse7 (or (let ((.cse8 (select (select (let ((.cse9 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse9 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse9 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (<= .cse8 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse8))) .cse2) .cse10 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) .cse11 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (let ((.cse12 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset))) (<= .cse12 (* 4294967296 (div .cse12 4294967296)))) .cse13)) (and .cse1 .cse0 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse3 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0)) .cse4 .cse5 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse7 .cse6 .cse10 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse11 .cse13))) [2020-12-04 18:51:12,403 INFO L258 CegarLoopResult]: At program point L10172(lines 10172 10188) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse2 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1)) (.cse4 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse5 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse7 (= (select |#valid| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) 1)) (.cse8 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse9 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse10 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse11 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0)))) (or (and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) .cse7 .cse8 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse9 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0) .cse10 .cse11 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (and (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|) .cse0 .cse1 (or (<= 13 ULTIMATE.start_hashlittle2_~length) (let ((.cse12 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset))) (and (<= .cse12 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse12)))) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse5 .cse6 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset) .cse11 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (let ((.cse13 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset))) (<= .cse13 (* 4294967296 (div .cse13 4294967296))))))) [2020-12-04 18:51:12,404 INFO L258 CegarLoopResult]: At program point L10106-2(lines 10106 10114) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse2 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse3 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) 1)) (.cse5 (not (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| 0))) (.cse6 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse8 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base 0))) (.cse9 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse10 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse13 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.offset 0)) (.cse14 (not (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base 0)))) (or (let ((.cse1 (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_~#c~9.base|))) (and .cse0 (or (<= 2287612045 ULTIMATE.start_hashlittle2_~length) (not .cse1)) .cse2 .cse3 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse4 .cse5 (not (= ULTIMATE.start_hashlittle2_~pc.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) .cse6 .cse7 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base)) (= (mod ULTIMATE.start_hashlittle2_~length 4294967296) 0) (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset 0) .cse8 .cse9 .cse10 (or (let ((.cse11 (select (select (let ((.cse12 (store |#memory_int| ULTIMATE.start_hashlittle2_~pc.base (store (select |#memory_int| ULTIMATE.start_hashlittle2_~pc.base) ULTIMATE.start_hashlittle2_~pc.offset ULTIMATE.start_hashlittle2_~c~5)))) (store .cse12 ULTIMATE.start_hashlittle2_~pb.base (store (select .cse12 ULTIMATE.start_hashlittle2_~pb.base) ULTIMATE.start_hashlittle2_~pb.offset ULTIMATE.start_hashlittle2_~b~3))) ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset|))) (and (<= .cse11 ULTIMATE.start_hashlittle2_~length) (<= ULTIMATE.start_hashlittle2_~length .cse11))) .cse1) .cse13 .cse14 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (let ((.cse15 (select (select |#memory_int| ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.base) ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset))) (<= .cse15 (* 4294967296 (div .cse15 4294967296)))))) (and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_byte_cursor_ptr_~cur~3.base) 4) 0)) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_hashlittle2_~pb.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.base|) (+ |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| 4)) 0)) .cse8 (= ULTIMATE.start_hashlittle2_~pc.offset 0) .cse9 .cse10 .cse13 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse14 (= ULTIMATE.start_aws_hash_byte_cursor_ptr_~item.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (= |ULTIMATE.start_aws_hash_byte_cursor_ptr_harness_~#cur~4.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)))) [2020-12-04 18:51:12,404 INFO L262 CegarLoopResult]: For program point L10106-3(lines 10106 10114) no Hoare annotation was computed. [2020-12-04 18:51:12,404 INFO L262 CegarLoopResult]: For program point L10140(line 10140) no Hoare annotation was computed. [2020-12-04 18:51:12,404 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-04 18:51:12,405 INFO L262 CegarLoopResult]: For program point L10140-2(line 10140) no Hoare annotation was computed. [2020-12-04 18:51:12,405 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:51:12,405 INFO L262 CegarLoopResult]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2020-12-04 18:51:12,405 INFO L262 CegarLoopResult]: For program point L10141(line 10141) no Hoare annotation was computed. [2020-12-04 18:51:12,405 INFO L262 CegarLoopResult]: For program point L10174-2(line 10174) no Hoare annotation was computed. [2020-12-04 18:51:12,406 INFO L262 CegarLoopResult]: For program point L10174(line 10174) no Hoare annotation was computed. [2020-12-04 18:51:12,406 INFO L262 CegarLoopResult]: For program point L6673-2(lines 6673 6675) no Hoare annotation was computed. [2020-12-04 18:51:12,406 INFO L262 CegarLoopResult]: For program point L6673(lines 6673 6675) no Hoare annotation was computed. [2020-12-04 18:51:12,406 INFO L262 CegarLoopResult]: For program point L10175-2(line 10175) no Hoare annotation was computed. [2020-12-04 18:51:12,406 INFO L262 CegarLoopResult]: For program point L10175(line 10175) no Hoare annotation was computed. [2020-12-04 18:51:12,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:51:12,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,463 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:51:12,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,483 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,483 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,493 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,494 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,499 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,500 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,505 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,508 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,515 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,537 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,537 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,538 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,540 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,547 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,551 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,555 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,556 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,560 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,560 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,562 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,562 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,585 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,585 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,588 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,588 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,590 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,590 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,602 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:12,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 06:51:12 BoogieIcfgContainer [2020-12-04 18:51:12,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 18:51:12,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 18:51:12,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 18:51:12,615 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 18:51:12,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:45:53" (3/4) ... [2020-12-04 18:51:12,623 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-04 18:51:12,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2020-12-04 18:51:12,670 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2020-12-04 18:51:12,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2020-12-04 18:51:12,676 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-04 18:51:12,679 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-04 18:51:12,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-04 18:51:12,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-04 18:51:12,687 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-04 18:51:12,751 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\valid[cur] == 1 && cur == cursor) && !(cur == 0)) && cur == 0) && !(\result == 0)) && cur == cursor [2020-12-04 18:51:12,752 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((#memory_$Pointer$[cur][4] == 0 && \result <= 1) && 1 <= \result) && cur == cursor) && \valid[cur] == 1) && cur == cursor) && !(cur == 0)) && #memory_$Pointer$[cur][4] == 0) && cur == 0) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && cur == cursor) && cur == cursor) || ((((((((((\result <= 1 && 1 <= \result) && cur == cursor) && \valid[cur] == 1) && cur == cursor) && !(cur == 0)) && cur == 0) && !(\result == 0)) && cur == cursor) && cur == cursor) && !(#memory_$Pointer$[cur][cur + 4] == 0))) || (((((cur == cursor && \result <= 0) && !(cur == 0)) && cur == 0) && cur == cursor) && 0 <= \result) [2020-12-04 18:51:12,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((item == cursor && \result <= 1) && cur == cursor) && \valid[item] == 1) && item == 0) && cur == cursor) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) || (((((((((((\result <= 1 && 1 <= \result) && item == cursor) && cur == cursor) && cursor == 0) && \valid[cur] == 1) && cur == 0) && !(item == 0)) && item == cursor) && cur == cursor) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) && cur == cursor)) || ((((((((cur == cursor && \result <= 0) && !(cur == 0)) && cur == 0) && !(item == 0)) && unknown-#memory_int-unknown[item][item] <= unknown-#memory_int-unknown[cursor][cursor]) && cur == cursor) && 0 <= \result) && unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[item][item]) [2020-12-04 18:51:12,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((item == cursor && \result <= 1) && (2287612045 <= length || !(cur == c))) && !(pc == cur)) && cur == cursor) && !(pb == cur)) && length % 4294967296 == 0) && \valid[item] == 1) && item == 0) && cur == cursor) && 1 <= \result) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == 0) && cur == cursor) && !(item == 0)) && item == cursor) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) && cur == cursor) || (((((((((((((((((\result <= 1 && item == cursor) && !(#memory_$Pointer$[cur][4] == 0)) && cursor == 0) && cursor == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && \valid[item] == 1) && item == 0) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && !(\result == 0)) && !(item == 0)) && cur == cursor) [2020-12-04 18:51:12,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result <= 1 && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && !(pc == cur)) && cur == 0) && cur == cursor) && !(pb == cur)) && length % 4294967296 == 0) && item == 0) && !(cur == 0)) && 1 <= \result) && cur == cursor) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == 0) && !(item == 0)) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) || ((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && \result <= 1) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && !(\result == 0)) && !(item == 0)) && item == cursor) && cur == cursor) [2020-12-04 18:51:12,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((\result <= 1 && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && \valid[cur] == 1) && cur == 0) && !(pc == cur)) && cur == cursor) && !(pb == cur)) && length % 4294967296 == 0) && !(cur == 0)) && 1 <= \result) && cur == cursor) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == 0) && !(item == 0)) && item == cursor) && cur == cur) && cur == cursor) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) || (((((((((((((((((\result <= 1 && !(#memory_$Pointer$[cur][4] == 0)) && item == cursor) && \valid[cur] == 1) && cur == 0) && cur == cursor) && pb == 0) && !(cur == 0)) && item == 0) && pc == 0) && cur == cursor) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) [2020-12-04 18:51:12,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && item == cursor) && \result <= 1) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && \valid[item] == 1) && !(cur == 0)) && pc == 0) && cur == cursor) && 1 <= \result) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) || (((((((((((((((((((((cur == cur && \result <= 1) && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && !(pc == cur)) && cur == 0) && cur == cursor) && !(pb == cur)) && \valid[item] == 1) && !(cur == 0)) && 1 <= \result) && cur == cursor) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == cursor) && !(item == 0)) && !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux) && cur == cur) && item == cursor) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) [2020-12-04 18:51:12,757 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((cur == cur && \result <= 1) && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(pc == cur)) && cur == cursor) && !(pb == cur)) && !(cur == 0)) && cur == cursor) && 1 <= \result) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == cursor) && !(item == 0)) && item == cursor) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) && cur == cursor) || (((((((((((((((((\result <= 1 && !(#memory_$Pointer$[cur][4] == 0)) && item == cursor) && cursor == 0) && \valid[cur] == 1) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) [2020-12-04 18:51:12,758 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux) && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length) && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) && \result <= 1) && item == cursor) && cursor == 0) && cur == cursor) && !(cur == c)) && unknown-#memory_int-unknown[cur][cur] <= 0) && 1 <= \result) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && item == cursor) && cur == cur) && cur == cursor) || ((((((((((cur == cur && \result <= 1) && 1 <= \result) && item == cursor) && cursor == 0) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && item == cursor) && cur == cur) && cur == cursor) && cur == cursor)) || (((((((((((((((((item == cursor && !(#memory_$Pointer$[cur][4] == 0)) && \result <= 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && cur == cursor) && 1 <= \result) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) [2020-12-04 18:51:12,760 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux) && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length) && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) && \result <= 1) && item == cursor) && cursor == 0) && cur == cursor) && !(cur == c)) && unknown-#memory_int-unknown[cur][cur] <= 0) && 1 <= \result) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && item == cursor) && cur == cur) && cur == cursor) || ((((((((((cur == cur && \result <= 1) && 1 <= \result) && item == cursor) && cursor == 0) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && item == cursor) && cur == cur) && cur == cursor) && cur == cursor)) || (((((((((((((((((item == cursor && !(#memory_$Pointer$[cur][4] == 0)) && \result <= 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && cur == cursor) && 1 <= \result) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) [2020-12-04 18:51:12,761 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && \result <= 1) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && \valid[item] == 1) && !(cur == 0)) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) || (((((((((((((((((((cur == cur && \result <= 1) && item == cursor) && (13 <= length || (unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]))) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && !(pc == cur)) && cur == 0) && cur == cursor) && !(pb == cur)) && item == cur) && \valid[item] == 1) && !(cur == 0)) && 1 <= \result) && cur == cursor) && cur == item) && !(item == 0)) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) [2020-12-04 18:51:12,762 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && \result <= 1) && !(#memory_$Pointer$[cursor][4] == 0)) && cursor == 0) && cursor == 0) && 1 <= cond) && !(cur == 0)) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && item == 0) && !(cur == 0)) && pc == 0) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == 0) && cur == cursor) && cond / 256 <= 0) && !(item == 0)) && !(\result == 0)) || (((((((((((!(cur == 0) && \result <= 1) && 1 <= \result) && cursor == 0) && 1 <= cond) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && cur == 0) && cond / 256 <= 0) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && cur == cursor)) || ((((((((((((((((cur == cur && \result <= 1) && cursor == 0) && 1 <= cond) && !(cur == 0)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && cur == cursor) && item == cur) && !(cur == 0)) && 1 <= \result) && cur == cursor) && cur == item) && cur == cursor) && cond / 256 <= 0) && !(item == 0)) && cur == cur) && cur == cursor) [2020-12-04 18:51:12,762 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((cur == cur && \result <= 1) && cursor == 0) && !(cur == 0)) && cur == 0) && cur == cursor) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && item == cur) && !(cur == 0)) && cur == cursor) && 1 <= \result) && cur == item) && !(item == 0)) && cur == cur) && cur == cursor) || (((((((((((((((((\result <= 1 && !(#memory_$Pointer$[cur][4] == 0)) && !(#memory_$Pointer$[cursor][4] == 0)) && cursor == 0) && cursor == 0) && !(cur == 0)) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && item == 0) && pc == 0) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0))) || (((((((((((((((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) && \result <= 1) && cursor == 0) && !(cur == 0)) && cur == 0) && !(cur == c)) && cur == cursor) && unknown-#memory_int-unknown[cur][cur] <= 0) && !(cur == 0)) && cur == cursor) && 1 <= \result) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(item == 0)) && ((0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) && cur == cur) [2020-12-04 18:51:12,763 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(cur == 0) && cur == cursor) && \result <= 1) && 1 <= \result) && !(cur == 0)) && cur == 0) && !(item == 0)) && cur == cursor [2020-12-04 18:51:13,828 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-04 18:51:13,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 18:51:13,830 INFO L168 Benchmark]: Toolchain (without parser) took 336477.63 ms. Allocated memory was 56.6 MB in the beginning and 635.4 MB in the end (delta: 578.8 MB). Free memory was 33.1 MB in the beginning and 407.4 MB in the end (delta: -374.3 MB). Peak memory consumption was 443.9 MB. Max. memory is 16.1 GB. [2020-12-04 18:51:13,831 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 44.0 MB. Free memory was 24.3 MB in the beginning and 24.3 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 18:51:13,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 6099.92 ms. Allocated memory was 56.6 MB in the beginning and 199.2 MB in the end (delta: 142.6 MB). Free memory was 33.0 MB in the beginning and 91.6 MB in the end (delta: -58.6 MB). Peak memory consumption was 121.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:51:13,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 300.21 ms. Allocated memory is still 199.2 MB. Free memory was 91.6 MB in the beginning and 75.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-04 18:51:13,832 INFO L168 Benchmark]: Boogie Preprocessor took 167.25 ms. Allocated memory is still 199.2 MB. Free memory was 75.8 MB in the beginning and 65.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:51:13,832 INFO L168 Benchmark]: RCFGBuilder took 9634.38 ms. Allocated memory was 199.2 MB in the beginning and 528.5 MB in the end (delta: 329.3 MB). Free memory was 65.4 MB in the beginning and 318.0 MB in the end (delta: -252.7 MB). Peak memory consumption was 253.8 MB. Max. memory is 16.1 GB. [2020-12-04 18:51:13,833 INFO L168 Benchmark]: TraceAbstraction took 319051.30 ms. Allocated memory was 528.5 MB in the beginning and 635.4 MB in the end (delta: 107.0 MB). Free memory was 318.0 MB in the beginning and 493.8 MB in the end (delta: -175.8 MB). Peak memory consumption was 237.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:51:13,833 INFO L168 Benchmark]: Witness Printer took 1214.72 ms. Allocated memory is still 635.4 MB. Free memory was 493.8 MB in the beginning and 407.4 MB in the end (delta: 86.4 MB). Peak memory consumption was 326.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:51:13,836 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.48 ms. Allocated memory is still 44.0 MB. Free memory was 24.3 MB in the beginning and 24.3 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 6099.92 ms. Allocated memory was 56.6 MB in the beginning and 199.2 MB in the end (delta: 142.6 MB). Free memory was 33.0 MB in the beginning and 91.6 MB in the end (delta: -58.6 MB). Peak memory consumption was 121.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 300.21 ms. Allocated memory is still 199.2 MB. Free memory was 91.6 MB in the beginning and 75.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 167.25 ms. Allocated memory is still 199.2 MB. Free memory was 75.8 MB in the beginning and 65.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9634.38 ms. Allocated memory was 199.2 MB in the beginning and 528.5 MB in the end (delta: 329.3 MB). Free memory was 65.4 MB in the beginning and 318.0 MB in the end (delta: -252.7 MB). Peak memory consumption was 253.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 319051.30 ms. Allocated memory was 528.5 MB in the beginning and 635.4 MB in the end (delta: 107.0 MB). Free memory was 318.0 MB in the beginning and 493.8 MB in the end (delta: -175.8 MB). Peak memory consumption was 237.4 MB. Max. memory is 16.1 GB. * Witness Printer took 1214.72 ms. Allocated memory is still 635.4 MB. Free memory was 493.8 MB in the beginning and 407.4 MB in the end (delta: 86.4 MB). Peak memory consumption was 326.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((\valid[cur] == 1 && cur == cursor) && !(cur == 0)) && cur == 0) && cur == cursor - InvariantResult [Line: 7403]: Loop Invariant [2020-12-04 18:51:13,850 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:51:13,851 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,851 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,852 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:51:13,852 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,852 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((#memory_$Pointer$[cur][4] == 0 && \result <= 1) && 1 <= \result) && cur == cursor) && \valid[cur] == 1) && cur == cursor) && !(cur == 0)) && #memory_$Pointer$[cur][4] == 0) && cur == 0) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && cur == cursor) && cur == cursor) || ((((((((((\result <= 1 && 1 <= \result) && cur == cursor) && \valid[cur] == 1) && cur == cursor) && !(cur == 0)) && cur == 0) && !(\result == 0)) && cur == cursor) && cur == cursor) && !(#memory_$Pointer$[cur][cur + 4] == 0))) || (((((cur == cursor && \result <= 0) && !(cur == 0)) && cur == 0) && cur == cursor) && 0 <= \result) - InvariantResult [Line: 10072]: Loop Invariant [2020-12-04 18:51:13,854 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,854 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,855 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,856 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((item == cursor && \result <= 1) && (2287612045 <= length || !(cur == c))) && !(pc == cur)) && cur == cursor) && !(pb == cur)) && length % 4294967296 == 0) && \valid[item] == 1) && item == 0) && cur == cursor) && 1 <= \result) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == 0) && cur == cursor) && !(item == 0)) && item == cursor) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) && cur == cursor) || (((((((((((((((((\result <= 1 && item == cursor) && !(#memory_$Pointer$[cur][4] == 0)) && cursor == 0) && cursor == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && \valid[item] == 1) && item == 0) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && !(\result == 0)) && !(item == 0)) && cur == cursor) - InvariantResult [Line: 11170]: Loop Invariant [2020-12-04 18:51:13,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,858 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,860 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && \result <= 1) && !(#memory_$Pointer$[cursor][4] == 0)) && cursor == 0) && cursor == 0) && 1 <= cond) && !(cur == 0)) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && item == 0) && !(cur == 0)) && pc == 0) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == 0) && cur == cursor) && cond / 256 <= 0) && !(item == 0)) && !(\result == 0)) || (((((((((((!(cur == 0) && \result <= 1) && 1 <= \result) && cursor == 0) && 1 <= cond) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && cur == 0) && cond / 256 <= 0) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && cur == cursor)) || ((((((((((((((((cur == cur && \result <= 1) && cursor == 0) && 1 <= cond) && !(cur == 0)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && cur == cursor) && item == cur) && !(cur == 0)) && 1 <= \result) && cur == cursor) && cur == item) && cur == cursor) && cond / 256 <= 0) && !(item == 0)) && cur == cur) && cur == cursor) - InvariantResult [Line: 10106]: Loop Invariant [2020-12-04 18:51:13,861 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,861 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,863 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,863 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((\result <= 1 && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && !(pc == cur)) && cur == 0) && cur == cursor) && !(pb == cur)) && length % 4294967296 == 0) && item == 0) && !(cur == 0)) && 1 <= \result) && cur == cursor) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == 0) && !(item == 0)) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) || ((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && \result <= 1) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && !(\result == 0)) && !(item == 0)) && item == cursor) && cur == cursor) - InvariantResult [Line: 11352]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6667]: Loop Invariant Derived loop invariant: (\valid[cur] == 1 && !(cur == 0)) && cur == 0 - InvariantResult [Line: 7403]: Loop Invariant [2020-12-04 18:51:13,865 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,865 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,866 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,866 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((cur == cur && \result <= 1) && cursor == 0) && !(cur == 0)) && cur == 0) && cur == cursor) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && item == cur) && !(cur == 0)) && cur == cursor) && 1 <= \result) && cur == item) && !(item == 0)) && cur == cur) && cur == cursor) || (((((((((((((((((\result <= 1 && !(#memory_$Pointer$[cur][4] == 0)) && !(#memory_$Pointer$[cursor][4] == 0)) && cursor == 0) && cursor == 0) && !(cur == 0)) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && item == 0) && pc == 0) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0))) || (((((((((((((((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) && \result <= 1) && cursor == 0) && !(cur == 0)) && cur == 0) && !(cur == c)) && cur == cursor) && unknown-#memory_int-unknown[cur][cur] <= 0) && !(cur == 0)) && cur == cursor) && 1 <= \result) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(item == 0)) && ((0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) && cur == cur) - InvariantResult [Line: 10084]: Loop Invariant [2020-12-04 18:51:13,871 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && item == cursor) && \result <= 1) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && \valid[item] == 1) && !(cur == 0)) && pc == 0) && cur == cursor) && 1 <= \result) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) || (((((((((((((((((((((cur == cur && \result <= 1) && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && !(pc == cur)) && cur == 0) && cur == cursor) && !(pb == cur)) && \valid[item] == 1) && !(cur == 0)) && 1 <= \result) && cur == cursor) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == cursor) && !(item == 0)) && !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux) && cur == cur) && item == cursor) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) - InvariantResult [Line: 7403]: Loop Invariant [2020-12-04 18:51:13,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,876 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((item == cursor && \result <= 1) && cur == cursor) && \valid[item] == 1) && item == 0) && cur == cursor) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) || (((((((((((\result <= 1 && 1 <= \result) && item == cursor) && cur == cursor) && cursor == 0) && \valid[cur] == 1) && cur == 0) && !(item == 0)) && item == cursor) && cur == cursor) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) && cur == cursor)) || ((((((((cur == cursor && \result <= 0) && !(cur == 0)) && cur == 0) && !(item == 0)) && unknown-#memory_int-unknown[item][item] <= unknown-#memory_int-unknown[cursor][cursor]) && cur == cursor) && 0 <= \result) && unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[item][item]) - InvariantResult [Line: 10172]: Loop Invariant [2020-12-04 18:51:13,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((!(#memory_$Pointer$[cur][4] == 0) && \result <= 1) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && \valid[item] == 1) && !(cur == 0)) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) || (((((((((((((((((((cur == cur && \result <= 1) && item == cursor) && (13 <= length || (unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]))) && cursor == 0) && \valid[cur] == 1) && !(cur == 0)) && !(pc == cur)) && cur == 0) && cur == cursor) && !(pb == cur)) && item == cur) && \valid[item] == 1) && !(cur == 0)) && 1 <= \result) && cur == cursor) && cur == item) && !(item == 0)) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) - InvariantResult [Line: 10054]: Loop Invariant [2020-12-04 18:51:13,881 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,881 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux) && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length) && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) && \result <= 1) && item == cursor) && cursor == 0) && cur == cursor) && !(cur == c)) && unknown-#memory_int-unknown[cur][cur] <= 0) && 1 <= \result) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && item == cursor) && cur == cur) && cur == cursor) || ((((((((((cur == cur && \result <= 1) && 1 <= \result) && item == cursor) && cursor == 0) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && item == cursor) && cur == cur) && cur == cursor) && cur == cursor)) || (((((((((((((((((item == cursor && !(#memory_$Pointer$[cur][4] == 0)) && \result <= 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && cur == cursor) && 1 <= \result) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) - InvariantResult [Line: 10118]: Loop Invariant [2020-12-04 18:51:13,889 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,889 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,890 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,891 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((cur == cur && \result <= 1) && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && \valid[cur] == 1) && !(pc == cur)) && cur == cursor) && !(pb == cur)) && !(cur == 0)) && cur == cursor) && 1 <= \result) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == cursor) && !(item == 0)) && item == cursor) && cur == cur) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) && cur == cursor) || (((((((((((((((((\result <= 1 && !(#memory_$Pointer$[cur][4] == 0)) && item == cursor) && cursor == 0) && \valid[cur] == 1) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && 1 <= \result) && cur == cursor) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) - InvariantResult [Line: 10152]: Loop Invariant [2020-12-04 18:51:13,892 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((\result <= 1 && (2287612045 <= length || !(cur == c))) && item == cursor) && cursor == 0) && \valid[cur] == 1) && cur == 0) && !(pc == cur)) && cur == cursor) && !(pb == cur)) && length % 4294967296 == 0) && !(cur == 0)) && 1 <= \result) && cur == cursor) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || cur == c)) && cur == 0) && !(item == 0)) && item == cursor) && cur == cur) && cur == cursor) && unknown-#memory_int-unknown[item][item] <= 4294967296 * (unknown-#memory_int-unknown[item][item] / 4294967296)) || (((((((((((((((((\result <= 1 && !(#memory_$Pointer$[cur][4] == 0)) && item == cursor) && \valid[cur] == 1) && cur == 0) && cur == cursor) && pb == 0) && !(cur == 0)) && item == 0) && pc == 0) && cur == cursor) && 1 <= \result) && !(#memory_$Pointer$[item][4] == 0)) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) - InvariantResult [Line: 7403]: Loop Invariant Derived loop invariant: ((((((!(cur == 0) && cur == cursor) && \result <= 1) && 1 <= \result) && !(cur == 0)) && cur == 0) && !(item == 0)) && cur == cursor - InvariantResult [Line: 11177]: Loop Invariant [2020-12-04 18:51:13,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:51:13,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux) && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length) && length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) && \result <= 1) && item == cursor) && cursor == 0) && cur == cursor) && !(cur == c)) && unknown-#memory_int-unknown[cur][cur] <= 0) && 1 <= \result) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && item == cursor) && cur == cur) && cur == cursor) || ((((((((((cur == cur && \result <= 1) && 1 <= \result) && item == cursor) && cursor == 0) && (((((((((!(cur == 0) && item == 0) && cur == cursor) && (2287612045 <= length || (length <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] && unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= length))) && 0 <= unknown-#memory_int-unknown[cur][cur]) && !(cur == 0)) && !(item == 0)) && unknown-#memory_int-unknown[cur][cur] <= 0) && ((unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur] <= 0 && 0 <= unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb := unknown-#memory_int-unknown[pc := unknown-#memory_int-unknown[pc][pc := c]][pb][pb := b]][cur][cur]) || !aux-switch(length) { case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; case 8 : b+=k[1]; a+=k[0]; break; case 7 : b+=k[1]&0xffffff; a+=k[0]; break; case 6 : b+=k[1]&0xffff; a+=k[0]; break; case 5 : b+=k[1]&0xff; a+=k[0]; break; case 4 : a+=k[0]; break; case 3 : a+=k[0]&0xffffff; break; case 2 : a+=k[0]&0xffff; break; case 1 : a+=k[0]&0xff; break; case 0 : *pc=c; *pb=b; return; }-aux)) || (((((((!(cur == 0) && cur == cursor) && !(cur == 0)) && cur == 0) && !(pc == cur)) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) && !(item == 0)) && !(pb == cur)))) && (13 <= length || (((unknown-#memory_int-unknown[cur][cur] <= length && length <= unknown-#memory_int-unknown[cur][cur]) && !(pc == cur)) && !(pb == cur)))) && item == cursor) && cur == cur) && cur == cursor) && cur == cursor)) || (((((((((((((((((item == cursor && !(#memory_$Pointer$[cur][4] == 0)) && \result <= 1) && !(cur == 0)) && cur == 0) && cur == cursor) && pb == 0) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(cur == 0)) && pc == 0) && cur == cursor) && 1 <= \result) && cur == 0) && cur == cursor) && !(item == 0)) && !(\result == 0)) && item == cursor) && cur == cursor) - InvariantResult [Line: 6894]: Loop Invariant Derived loop invariant: ((((\valid[cur] == 1 && cur == cursor) && !(cur == 0)) && cur == 0) && !(\result == 0)) && cur == cursor - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 266.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 214.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4214 SDtfs, 13000 SDslu, 16606 SDs, 0 SdLazy, 10652 SolverSat, 962 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 156.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 46.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred 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.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 2150 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 80 NumberOfFragments, 3619 HoareAnnotationTreeSize, 17 FomulaSimplifications, 254603196 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 17 FomulaSimplificationsInter, 7525446 FormulaSimplificationTreeSizeReductionInter, 49.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 24.3s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 1405 NumberOfCodeBlocks, 1405 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1378 ConstructedInterpolants, 0 QuantifiedInterpolants, 802347 SizeOfPredicates, 72 NumberOfNonLiveVariables, 8715 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 3/6 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...