/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:10:41,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:10:41,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:10:41,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:10:41,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:10:41,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:10:41,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:10:41,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:10:41,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:10:41,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:10:41,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:10:41,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:10:41,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:10:41,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:10:41,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:10:41,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:10:41,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:10:41,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:10:41,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:10:41,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:10:41,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:10:41,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:10:41,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:10:41,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:10:41,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:10:41,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:10:41,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:10:41,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:10:41,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:10:41,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:10:41,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:10:41,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:10:41,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:10:41,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:10:41,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:10:41,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:10:41,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:10:41,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:10:41,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:10:41,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:10:41,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:10:41,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:10:41,578 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:10:41,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:10:41,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:10:41,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:10:41,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:10:41,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:10:41,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:10:41,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:10:41,580 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:10:41,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:10:41,581 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:10:41,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:10:41,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:10:41,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:10:41,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:10:41,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:10:41,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:10:41,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:10:41,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:10:41,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:10:41,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:10:41,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:10:41,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:10:41,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:10:41,584 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:10:41,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:10:41,584 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:10:41,584 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-02 01:10:41,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:10:41,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:10:41,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:10:41,827 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:10:41,828 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:10:41,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-04-02 01:10:42,958 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:10:43,197 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:10:43,198 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-04-02 01:10:43,210 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c2c30733/da5262f374d4489f87d6037a31650276/FLAGdbeb112d7 [2023-04-02 01:10:43,221 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c2c30733/da5262f374d4489f87d6037a31650276 [2023-04-02 01:10:43,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:10:43,225 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:10:43,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:10:43,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:10:43,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:10:43,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e67c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43, skipping insertion in model container [2023-04-02 01:10:43,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:10:43,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:10:43,547 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-04-02 01:10:43,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:10:43,565 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:10:43,613 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-04-02 01:10:43,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:10:43,637 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:10:43,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43 WrapperNode [2023-04-02 01:10:43,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:10:43,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:10:43,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:10:43,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:10:43,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:10:43,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:10:43,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:10:43,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:10:43,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (1/1) ... [2023-04-02 01:10:43,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:10:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:43,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 01:10:43,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 01:10:43,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:10:43,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2023-04-02 01:10:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2023-04-02 01:10:43,763 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2023-04-02 01:10:43,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:10:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:10:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:10:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:10:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:10:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:10:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 01:10:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 01:10:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 01:10:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 01:10:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 01:10:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 01:10:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 01:10:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 01:10:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 01:10:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 01:10:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 01:10:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:10:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2023-04-02 01:10:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:10:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2023-04-02 01:10:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:10:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:10:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:10:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:10:44,029 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:10:44,031 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:10:44,125 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 01:10:44,265 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:10:44,271 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:10:44,271 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-02 01:10:44,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:10:44 BoogieIcfgContainer [2023-04-02 01:10:44,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:10:44,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:10:44,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:10:44,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:10:44,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:10:43" (1/3) ... [2023-04-02 01:10:44,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781176af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:10:44, skipping insertion in model container [2023-04-02 01:10:44,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:43" (2/3) ... [2023-04-02 01:10:44,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781176af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:10:44, skipping insertion in model container [2023-04-02 01:10:44,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:10:44" (3/3) ... [2023-04-02 01:10:44,287 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2023-04-02 01:10:44,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:10:44,304 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:10:44,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:10:44,359 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1af65dba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:10:44,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:10:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:10:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-02 01:10:44,373 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:44,374 INFO L195 NwaCegarLoop]: 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] [2023-04-02 01:10:44,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:44,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1399110343, now seen corresponding path program 1 times [2023-04-02 01:10:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:44,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464168086] [2023-04-02 01:10:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 01:10:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464168086] [2023-04-02 01:10:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464168086] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:44,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:10:44,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:10:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854224465] [2023-04-02 01:10:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:44,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:10:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:10:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:10:44,867 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:10:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:45,299 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2023-04-02 01:10:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:10:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2023-04-02 01:10:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:45,306 INFO L225 Difference]: With dead ends: 100 [2023-04-02 01:10:45,307 INFO L226 Difference]: Without dead ends: 46 [2023-04-02 01:10:45,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:10:45,312 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:45,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 16 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 01:10:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-04-02 01:10:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-04-02 01:10:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 01:10:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-04-02 01:10:45,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2023-04-02 01:10:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:45,347 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-04-02 01:10:45,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:10:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-04-02 01:10:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-02 01:10:45,348 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:45,348 INFO L195 NwaCegarLoop]: 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] [2023-04-02 01:10:45,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:10:45,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:45,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1065674723, now seen corresponding path program 1 times [2023-04-02 01:10:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:45,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167280075] [2023-04-02 01:10:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:45,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 01:10:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:45,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:45,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167280075] [2023-04-02 01:10:45,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167280075] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:45,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538298415] [2023-04-02 01:10:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:45,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:45,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:45,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 01:10:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:45,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:10:45,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:45,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:10:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:46,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538298415] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:10:46,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:10:46,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-04-02 01:10:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921780224] [2023-04-02 01:10:46,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:10:46,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 01:10:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 01:10:46,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:10:46,055 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 7 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-02 01:10:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:46,346 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-04-02 01:10:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 01:10:46,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 7 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2023-04-02 01:10:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:46,356 INFO L225 Difference]: With dead ends: 75 [2023-04-02 01:10:46,356 INFO L226 Difference]: Without dead ends: 50 [2023-04-02 01:10:46,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-04-02 01:10:46,360 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 74 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:46,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 13 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:10:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-04-02 01:10:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-04-02 01:10:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:10:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2023-04-02 01:10:46,384 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 34 [2023-04-02 01:10:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:46,384 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2023-04-02 01:10:46,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 7 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-02 01:10:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2023-04-02 01:10:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-02 01:10:46,386 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:46,386 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:46,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 01:10:46,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:46,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:46,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1739605433, now seen corresponding path program 2 times [2023-04-02 01:10:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57920778] [2023-04-02 01:10:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:46,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:46,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-04-02 01:10:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 01:10:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:46,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57920778] [2023-04-02 01:10:46,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57920778] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:46,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:10:46,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:10:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388339847] [2023-04-02 01:10:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:46,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:10:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:10:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:10:46,779 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:10:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:46,991 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-04-02 01:10:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:10:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2023-04-02 01:10:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:46,995 INFO L225 Difference]: With dead ends: 70 [2023-04-02 01:10:46,995 INFO L226 Difference]: Without dead ends: 57 [2023-04-02 01:10:46,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-04-02 01:10:46,998 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 81 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:46,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 7 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:10:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-02 01:10:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-04-02 01:10:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:10:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-04-02 01:10:47,013 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 43 [2023-04-02 01:10:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:47,014 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-04-02 01:10:47,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:10:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-04-02 01:10:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-04-02 01:10:47,017 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:47,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:47,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 01:10:47,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:47,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 107451011, now seen corresponding path program 1 times [2023-04-02 01:10:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644580504] [2023-04-02 01:10:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-04-02 01:10:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 01:10:47,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:47,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644580504] [2023-04-02 01:10:47,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644580504] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:47,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573978307] [2023-04-02 01:10:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:47,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:47,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:47,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:47,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 01:10:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:10:47,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 01:10:47,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:10:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573978307] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 01:10:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-04-02 01:10:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509450921] [2023-04-02 01:10:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:47,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:10:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:10:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:10:47,488 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:10:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:47,546 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2023-04-02 01:10:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:10:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 51 [2023-04-02 01:10:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:47,549 INFO L225 Difference]: With dead ends: 82 [2023-04-02 01:10:47,549 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 01:10:47,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:10:47,550 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:47,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 166 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:10:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 01:10:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2023-04-02 01:10:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-02 01:10:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-04-02 01:10:47,560 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 51 [2023-04-02 01:10:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:47,560 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-04-02 01:10:47,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:10:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-04-02 01:10:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-04-02 01:10:47,561 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:47,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:47,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 01:10:47,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-02 01:10:47,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:47,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2040098735, now seen corresponding path program 1 times [2023-04-02 01:10:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979694123] [2023-04-02 01:10:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-04-02 01:10:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 01:10:47,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979694123] [2023-04-02 01:10:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979694123] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373212151] [2023-04-02 01:10:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:47,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:47,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:47,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:47,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 01:10:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 01:10:48,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 01:10:48,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:10:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 01:10:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373212151] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:10:48,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:10:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 10 [2023-04-02 01:10:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701421752] [2023-04-02 01:10:48,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:10:48,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 01:10:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 01:10:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 01:10:48,166 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-02 01:10:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:48,405 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2023-04-02 01:10:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:10:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 52 [2023-04-02 01:10:48,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:48,408 INFO L225 Difference]: With dead ends: 76 [2023-04-02 01:10:48,408 INFO L226 Difference]: Without dead ends: 63 [2023-04-02 01:10:48,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-04-02 01:10:48,410 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 105 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:48,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 13 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:10:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-02 01:10:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2023-04-02 01:10:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-02 01:10:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-04-02 01:10:48,429 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 52 [2023-04-02 01:10:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:48,429 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-04-02 01:10:48,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-02 01:10:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-04-02 01:10:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-04-02 01:10:48,430 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:48,430 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:48,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 01:10:48,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:48,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:48,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1898289543, now seen corresponding path program 2 times [2023-04-02 01:10:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:48,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368906293] [2023-04-02 01:10:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:10:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 01:10:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-02 01:10:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368906293] [2023-04-02 01:10:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368906293] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:10:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 01:10:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075154905] [2023-04-02 01:10:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:48,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 01:10:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:48,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 01:10:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 01:10:48,854 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 01:10:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:49,113 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-04-02 01:10:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 01:10:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2023-04-02 01:10:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:49,116 INFO L225 Difference]: With dead ends: 78 [2023-04-02 01:10:49,116 INFO L226 Difference]: Without dead ends: 66 [2023-04-02 01:10:49,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-04-02 01:10:49,118 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 82 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:49,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 13 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:10:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-04-02 01:10:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2023-04-02 01:10:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-04-02 01:10:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2023-04-02 01:10:49,136 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 60 [2023-04-02 01:10:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:49,137 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2023-04-02 01:10:49,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 01:10:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2023-04-02 01:10:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-02 01:10:49,142 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:49,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:49,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 01:10:49,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:49,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash -667690481, now seen corresponding path program 1 times [2023-04-02 01:10:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656345108] [2023-04-02 01:10:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:50,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:10:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 01:10:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 01:10:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:51,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656345108] [2023-04-02 01:10:51,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656345108] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:51,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163255027] [2023-04-02 01:10:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:51,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:51,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:51,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 01:10:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:51,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 116 conjunts are in the unsatisfiable core [2023-04-02 01:10:51,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:51,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:10:51,887 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:10:51,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 01:10:51,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:10:51,927 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 01:10:52,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-04-02 01:10:52,367 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:10:52,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2023-04-02 01:10:52,374 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 34 [2023-04-02 01:10:52,566 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_760 (Array Int Int))) (= (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| v_ArrVal_760) |c_#memory_int|)) (exists ((v_ArrVal_762 Int) (v_ArrVal_761 Int) (sll_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset v_ArrVal_761)) |c_#memory_$Pointer$.offset|) (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset v_ArrVal_762)))))) is different from true [2023-04-02 01:10:52,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:10:52,594 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 30 [2023-04-02 01:10:52,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:10:52,602 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 34 [2023-04-02 01:10:52,608 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2023-04-02 01:10:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-04-02 01:10:53,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:10:53,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163255027] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:53,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:10:53,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 54 [2023-04-02 01:10:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305483389] [2023-04-02 01:10:53,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:10:53,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-04-02 01:10:53,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:53,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-04-02 01:10:53,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3329, Unknown=18, NotChecked=116, Total=3660 [2023-04-02 01:10:53,827 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 54 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 42 states have internal predecessors, (80), 9 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-04-02 01:10:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:56,711 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2023-04-02 01:10:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-04-02 01:10:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 42 states have internal predecessors, (80), 9 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 61 [2023-04-02 01:10:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:56,713 INFO L225 Difference]: With dead ends: 115 [2023-04-02 01:10:56,713 INFO L226 Difference]: Without dead ends: 113 [2023-04-02 01:10:56,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=601, Invalid=8114, Unknown=31, NotChecked=184, Total=8930 [2023-04-02 01:10:56,718 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 327 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:56,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 49 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2490 Invalid, 0 Unknown, 130 Unchecked, 1.4s Time] [2023-04-02 01:10:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-04-02 01:10:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2023-04-02 01:10:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 74 states have internal predecessors, (82), 12 states have call successors, (12), 7 states have call predecessors, (12), 11 states have return successors, (20), 11 states have call predecessors, (20), 11 states have call successors, (20) [2023-04-02 01:10:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2023-04-02 01:10:56,739 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 61 [2023-04-02 01:10:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:56,739 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2023-04-02 01:10:56,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 42 states have internal predecessors, (80), 9 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-04-02 01:10:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2023-04-02 01:10:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-04-02 01:10:56,742 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:56,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:56,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 01:10:56,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:56,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:56,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash -943443909, now seen corresponding path program 2 times [2023-04-02 01:10:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:56,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498948514] [2023-04-02 01:10:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-04-02 01:10:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-04-02 01:10:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-02 01:10:57,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498948514] [2023-04-02 01:10:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498948514] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235758403] [2023-04-02 01:10:57,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:10:57,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:57,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:57,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:57,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 01:10:57,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:10:57,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:10:57,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:10:57,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 01:10:57,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:10:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-02 01:10:57,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235758403] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:10:57,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:10:57,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2023-04-02 01:10:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399001219] [2023-04-02 01:10:57,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:10:57,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 01:10:57,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 01:10:57,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-04-02 01:10:57,509 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-02 01:10:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:57,913 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2023-04-02 01:10:57,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 01:10:57,913 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Word has length 62 [2023-04-02 01:10:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:57,914 INFO L225 Difference]: With dead ends: 136 [2023-04-02 01:10:57,914 INFO L226 Difference]: Without dead ends: 95 [2023-04-02 01:10:57,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2023-04-02 01:10:57,915 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 130 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:57,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 15 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:10:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-04-02 01:10:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2023-04-02 01:10:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.171875) internal successors, (75), 69 states have internal predecessors, (75), 12 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (17), 10 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-02 01:10:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2023-04-02 01:10:57,928 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 62 [2023-04-02 01:10:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:57,928 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2023-04-02 01:10:57,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-02 01:10:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2023-04-02 01:10:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-04-02 01:10:57,929 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:57,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:57,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 01:10:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:58,134 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:58,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2086905359, now seen corresponding path program 3 times [2023-04-02 01:10:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233810679] [2023-04-02 01:10:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:10:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-04-02 01:10:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 01:10:58,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233810679] [2023-04-02 01:10:58,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233810679] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967521359] [2023-04-02 01:10:58,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:10:58,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:58,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:58,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 01:10:58,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 01:10:58,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:10:58,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:10:58,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 01:10:58,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:10:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 01:10:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967521359] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:10:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2023-04-02 01:10:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432397220] [2023-04-02 01:10:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:58,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:10:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:10:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:10:58,683 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 01:10:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:58,718 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2023-04-02 01:10:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:10:58,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2023-04-02 01:10:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:58,720 INFO L225 Difference]: With dead ends: 108 [2023-04-02 01:10:58,720 INFO L226 Difference]: Without dead ends: 89 [2023-04-02 01:10:58,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:10:58,721 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:58,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 118 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:10:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-04-02 01:10:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-04-02 01:10:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 70 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-02 01:10:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2023-04-02 01:10:58,735 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 62 [2023-04-02 01:10:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:58,736 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2023-04-02 01:10:58,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 01:10:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2023-04-02 01:10:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-04-02 01:10:58,737 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:58,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:58,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 01:10:58,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:58,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:58,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1173825223, now seen corresponding path program 4 times [2023-04-02 01:10:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173955687] [2023-04-02 01:10:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:10:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 01:10:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-02 01:10:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173955687] [2023-04-02 01:10:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173955687] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101421943] [2023-04-02 01:10:59,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 01:10:59,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:59,124 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:59,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 01:10:59,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 01:10:59,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:10:59,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:10:59,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-02 01:10:59,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:10:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-02 01:10:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101421943] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:59,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:10:59,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 15 [2023-04-02 01:10:59,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811933068] [2023-04-02 01:10:59,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:59,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:10:59,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:10:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-04-02 01:10:59,482 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 01:10:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:59,535 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2023-04-02 01:10:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 01:10:59,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 62 [2023-04-02 01:10:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:59,536 INFO L225 Difference]: With dead ends: 127 [2023-04-02 01:10:59,537 INFO L226 Difference]: Without dead ends: 85 [2023-04-02 01:10:59,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-04-02 01:10:59,538 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:59,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:10:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-04-02 01:10:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-04-02 01:10:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.126984126984127) internal successors, (71), 66 states have internal predecessors, (71), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-04-02 01:10:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-04-02 01:10:59,550 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 62 [2023-04-02 01:10:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:59,551 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-04-02 01:10:59,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 01:10:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-04-02 01:10:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-04-02 01:10:59,552 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:59,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:59,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 01:10:59,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:59,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:59,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1925270907, now seen corresponding path program 5 times [2023-04-02 01:10:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:59,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385901652] [2023-04-02 01:10:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:10:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:10:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:10:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:10:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:10:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-04-02 01:10:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 01:10:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-02 01:10:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385901652] [2023-04-02 01:10:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385901652] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414262327] [2023-04-02 01:10:59,928 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-02 01:10:59,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:59,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:59,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:10:59,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 01:11:00,118 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-04-02 01:11:00,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:00,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-02 01:11:00,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-02 01:11:00,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-02 01:11:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414262327] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:00,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-04-02 01:11:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264307895] [2023-04-02 01:11:00,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:00,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 01:11:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:00,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 01:11:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-04-02 01:11:00,340 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-04-02 01:11:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:00,771 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2023-04-02 01:11:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 01:11:00,772 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 70 [2023-04-02 01:11:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:00,773 INFO L225 Difference]: With dead ends: 99 [2023-04-02 01:11:00,773 INFO L226 Difference]: Without dead ends: 66 [2023-04-02 01:11:00,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2023-04-02 01:11:00,774 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 116 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:00,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 17 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:11:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-04-02 01:11:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-04-02 01:11:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 49 states have internal predecessors, (53), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-02 01:11:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-04-02 01:11:00,782 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 70 [2023-04-02 01:11:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:00,783 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-04-02 01:11:00,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-04-02 01:11:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-04-02 01:11:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-02 01:11:00,783 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:00,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:00,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:00,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 01:11:00,989 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:00,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1464991942, now seen corresponding path program 1 times [2023-04-02 01:11:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354084483] [2023-04-02 01:11:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:11:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:11:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:11:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:11:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:11:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 01:11:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-04-02 01:11:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-02 01:11:01,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354084483] [2023-04-02 01:11:01,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354084483] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2522563] [2023-04-02 01:11:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:01,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:01,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:01,533 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:01,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 01:11:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 65 conjunts are in the unsatisfiable core [2023-04-02 01:11:01,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:01,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:02,132 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-04-02 01:11:02,132 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 16 [2023-04-02 01:11:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-02 01:11:02,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:02,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-04-02 01:11:02,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:02,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-02 01:11:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2522563] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:02,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 35 [2023-04-02 01:11:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339340365] [2023-04-02 01:11:02,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:02,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-02 01:11:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-02 01:11:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 01:11:02,685 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 35 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 11 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-04-02 01:11:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:03,725 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-04-02 01:11:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-04-02 01:11:03,727 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 11 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 71 [2023-04-02 01:11:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:03,727 INFO L225 Difference]: With dead ends: 79 [2023-04-02 01:11:03,727 INFO L226 Difference]: Without dead ends: 75 [2023-04-02 01:11:03,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 131 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=357, Invalid=2723, Unknown=0, NotChecked=0, Total=3080 [2023-04-02 01:11:03,733 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 150 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:03,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 43 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1294 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 01:11:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-04-02 01:11:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2023-04-02 01:11:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 54 states have internal predecessors, (57), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:11:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-04-02 01:11:03,745 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 71 [2023-04-02 01:11:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:03,745 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-04-02 01:11:03,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 11 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-04-02 01:11:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-04-02 01:11:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-04-02 01:11:03,746 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:03,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:03,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:03,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:03,954 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:03,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -120366738, now seen corresponding path program 2 times [2023-04-02 01:11:03,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:03,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472030090] [2023-04-02 01:11:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:11:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 01:11:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 01:11:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 01:11:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:11:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 01:11:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-04-02 01:11:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-02 01:11:04,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:04,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472030090] [2023-04-02 01:11:04,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472030090] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:04,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884200228] [2023-04-02 01:11:04,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:11:04,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:04,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:04,134 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:04,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 01:11:04,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:11:04,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:04,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:11:04,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-02 01:11:04,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-02 01:11:04,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884200228] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:04,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:11:04,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 15 [2023-04-02 01:11:04,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398746702] [2023-04-02 01:11:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:11:04,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:11:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:11:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-04-02 01:11:04,587 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-02 01:11:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:04,657 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2023-04-02 01:11:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 01:11:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 72 [2023-04-02 01:11:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:04,658 INFO L225 Difference]: With dead ends: 88 [2023-04-02 01:11:04,658 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 01:11:04,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-02 01:11:04,659 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:04,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 168 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:11:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 01:11:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 01:11:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-02 01:11:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 01:11:04,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2023-04-02 01:11:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:04,660 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 01:11:04,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-02 01:11:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 01:11:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 01:11:04,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 01:11:04,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:04,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-02 01:11:04,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 01:11:05,471 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-02 01:11:05,471 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2023-04-02 01:11:05,471 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-02 01:11:05,471 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (< 1 |sll_update_at_#in~index|) (and .cse0 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse1 .cse2 (= |sll_update_at_#in~index| sll_update_at_~index) .cse3 (= |sll_update_at_#in~head.base| sll_update_at_~head.base)) (let ((.cse4 (+ sll_update_at_~index 1)) (.cse5 (+ |sll_update_at_#in~head.offset| 4))) (and (<= 1 |sll_update_at_#in~index|) .cse0 (<= .cse4 |sll_update_at_#in~index|) .cse1 .cse2 .cse3 (<= |sll_update_at_#in~index| .cse4) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse5) sll_update_at_~head.offset) (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse5) sll_update_at_~head.base))))) [2023-04-02 01:11:05,471 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2023-04-02 01:11:05,471 INFO L899 garLoopResultBuilder]: For program point sll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2023-04-02 01:11:05,471 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 606 612) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (< 1 |sll_update_at_#in~index|)) [2023-04-02 01:11:05,471 INFO L899 garLoopResultBuilder]: For program point sll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2023-04-02 01:11:05,471 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-04-02 01:11:05,471 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 571 573) the Hoare annotation is: true [2023-04-02 01:11:05,472 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2023-04-02 01:11:05,472 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-04-02 01:11:05,472 INFO L899 garLoopResultBuilder]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2023-04-02 01:11:05,472 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 592 598) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-04-02 01:11:05,472 INFO L899 garLoopResultBuilder]: For program point sll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2023-04-02 01:11:05,472 INFO L899 garLoopResultBuilder]: For program point sll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2023-04-02 01:11:05,472 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (or (forall ((v_main_~s~0.offset_BEFORE_CALL_5 Int) (v_main_~s~0.base_BEFORE_CALL_5 Int)) (let ((.cse0 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_5) v_main_~s~0.offset_BEFORE_CALL_5))) (or (< .cse0 2) (< 2 .cse0)))) (let ((.cse1 (+ |sll_get_data_at_#in~head.offset| 4))) (and (<= sll_get_data_at_~index 0) (<= 1 |sll_get_data_at_#in~index|) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse1)) (= (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse1) sll_get_data_at_~head.offset))) (<= 2 |sll_get_data_at_#in~index|) (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse3 (+ v_main_~s~0.offset_BEFORE_CALL_3 4))) (let ((.cse2 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) .cse3))) (or (not (= (select (select |#memory_int| .cse2) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) .cse3)) 3)) (= v_main_~s~0.base_BEFORE_CALL_3 .cse2))))) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) [2023-04-02 01:11:05,472 INFO L899 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2023-04-02 01:11:05,472 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 599 605) the Hoare annotation is: true [2023-04-02 01:11:05,472 INFO L899 garLoopResultBuilder]: For program point sll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2023-04-02 01:11:05,472 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point sll_createEXIT(lines 583 591) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (or (and (= |sll_create_#in~len| sll_create_~len) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (and (or (< 0 sll_create_~len) (<= |sll_create_#in~len| 1)) (= (select |#valid| sll_create_~head~0.base) 1))) [2023-04-02 01:11:05,473 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 583 591) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and (= |sll_create_#in~len| sll_create_~len) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (and (<= |sll_create_#in~len| (+ sll_create_~len 1)) .cse0) (and (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~head~0.offset 0) .cse0))) [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point sll_createFINAL(lines 583 591) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L902 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: true [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-04-02 01:11:05,473 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point L628(line 628) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L895 garLoopResultBuilder]: At program point L624(line 624) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse9 (select (select |#memory_int| main_~s~0.base) 0))) (let ((.cse0 (<= 2 main_~new_data~0)) (.cse1 (<= .cse9 2)) (.cse2 (not (= main_~s~0.base .cse11))) (.cse3 (<= 3 .cse10)) (.cse4 (= main_~len~0 2)) (.cse5 (<= main_~new_data~0 2)) (.cse6 (<= .cse10 3)) (.cse7 (<= 2 .cse9)) (.cse8 (= main_~s~0.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~i~0 0) (= 2 main_~expected~0) .cse7 .cse8) (and .cse0 .cse1 (= 3 main_~expected~0) .cse2 (= main_~i~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point L624-1(line 624) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2023-04-02 01:11:05,474 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2023-04-02 01:11:05,475 INFO L895 garLoopResultBuilder]: At program point L620(line 620) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse0 (not (= main_~s~0.base .cse4))) (.cse1 (= main_~len~0 2)) (.cse2 (= main_~s~0.offset 0))) (or (and .cse0 (<= 3 main_~new_data~0) (<= main_~new_data~0 3) (= main_~i~0 1) .cse1 .cse2) (let ((.cse3 (select (select |#memory_int| .cse4) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and (<= 2 main_~new_data~0) .cse0 (<= 3 .cse3) .cse1 (<= main_~new_data~0 2) (<= .cse3 3) (= main_~i~0 0) .cse2))))) [2023-04-02 01:11:05,475 INFO L899 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2023-04-02 01:11:05,475 INFO L899 garLoopResultBuilder]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2023-04-02 01:11:05,475 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse10 (select |#memory_int| main_~s~0.base)) (.cse12 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse11 (select (select |#memory_int| .cse12) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse13 (select .cse10 0))) (let ((.cse1 (<= .cse13 2)) (.cse7 (<= 2 .cse13)) (.cse0 (<= 2 main_~new_data~0)) (.cse2 (not (= main_~s~0.base .cse12))) (.cse3 (<= 3 .cse11)) (.cse4 (= main_~len~0 2)) (.cse5 (<= main_~new_data~0 2)) (.cse6 (<= .cse11 3)) (.cse8 (= main_~s~0.offset 0))) (or (and .cse0 .cse1 .cse2 (= main_~i~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 main_~expected~0) .cse7 .cse8) (let ((.cse9 (select .cse10 main_~s~0.offset))) (and .cse0 .cse2 (<= 2 .cse9) (<= .cse9 2) .cse3 .cse4 .cse5 .cse6 (= main_~i~0 0) .cse8))) (<= main_~i~0 0)))))) [2023-04-02 01:11:05,475 INFO L895 garLoopResultBuilder]: At program point L622-4(lines 622 627) the Hoare annotation is: (= main_~len~0 2) [2023-04-02 01:11:05,475 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 613 632) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-04-02 01:11:05,475 INFO L895 garLoopResultBuilder]: At program point L616(line 616) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= main_~len~0 2) (= |old(#valid)| |#valid|)) [2023-04-02 01:11:05,475 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse6 (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse0 (not (= main_~s~0.base .cse7))) (.cse4 (<= 3 .cse6)) (.cse1 (= main_~len~0 2)) (.cse5 (<= .cse6 3)) (.cse2 (= main_~s~0.offset 0))) (or (and .cse0 (= main_~i~0 1) .cse1 .cse2) (let ((.cse3 (select (select |#memory_int| main_~s~0.base) 0))) (and (<= 2 main_~new_data~0) (<= .cse3 2) .cse0 (<= main_~i~0 0) .cse4 .cse1 (<= main_~new_data~0 2) .cse5 (<= 2 .cse3) .cse2)) (and .cse0 .cse4 .cse1 .cse5 (= main_~i~0 0) (= 3 main_~new_data~0) .cse2))))) [2023-04-02 01:11:05,475 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L895 garLoopResultBuilder]: At program point ERROR(lines 613 632) the Hoare annotation is: false [2023-04-02 01:11:05,476 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L899 garLoopResultBuilder]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L899 garLoopResultBuilder]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-02 01:11:05,476 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:11:05,476 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 01:11:05,479 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1] [2023-04-02 01:11:05,481 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 01:11:05,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,503 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:11:05 BoogieIcfgContainer [2023-04-02 01:11:05,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 01:11:05,514 INFO L158 Benchmark]: Toolchain (without parser) took 22289.36ms. Allocated memory was 353.4MB in the beginning and 640.7MB in the end (delta: 287.3MB). Free memory was 301.9MB in the beginning and 444.9MB in the end (delta: -143.0MB). Peak memory consumption was 145.3MB. Max. memory is 8.0GB. [2023-04-02 01:11:05,514 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 01:11:05,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.69ms. Allocated memory is still 353.4MB. Free memory was 301.3MB in the beginning and 284.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-02 01:11:05,515 INFO L158 Benchmark]: Boogie Preprocessor took 54.08ms. Allocated memory is still 353.4MB. Free memory was 284.6MB in the beginning and 281.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-04-02 01:11:05,515 INFO L158 Benchmark]: RCFGBuilder took 579.77ms. Allocated memory is still 353.4MB. Free memory was 281.4MB in the beginning and 258.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-04-02 01:11:05,515 INFO L158 Benchmark]: TraceAbstraction took 21238.86ms. Allocated memory was 353.4MB in the beginning and 640.7MB in the end (delta: 287.3MB). Free memory was 258.4MB in the beginning and 444.9MB in the end (delta: -186.6MB). Peak memory consumption was 101.3MB. Max. memory is 8.0GB. [2023-04-02 01:11:05,516 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.13ms. Allocated memory is still 226.5MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 411.69ms. Allocated memory is still 353.4MB. Free memory was 301.3MB in the beginning and 284.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.08ms. Allocated memory is still 353.4MB. Free memory was 284.6MB in the beginning and 281.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.77ms. Allocated memory is still 353.4MB. Free memory was 281.4MB in the beginning and 258.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 21238.86ms. Allocated memory was 353.4MB in the beginning and 640.7MB in the end (delta: 287.3MB). Free memory was 258.4MB in the beginning and 444.9MB in the end (delta: -186.6MB). Peak memory consumption was 101.3MB. Max. memory is 8.0GB. * 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$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1234 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1222 mSDsluCounter, 832 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 130 IncrementalHoareTripleChecker+Unchecked, 639 mSDsCounter, 378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6081 IncrementalHoareTripleChecker+Invalid, 6590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 378 mSolverCounterUnsat, 193 mSDtfsCounter, 6081 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1484 GetRequests, 1135 SyntacticMatches, 28 SemanticMatches, 321 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3348 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 74 PreInvPairs, 104 NumberOfFragments, 909 HoareAnnotationTreeSize, 74 FomulaSimplifications, 3044 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 1052 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1322 NumberOfCodeBlocks, 1276 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1776 ConstructedInterpolants, 21 QuantifiedInterpolants, 6433 SizeOfPredicates, 52 NumberOfNonLiveVariables, 3294 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 605/739 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 607]: Loop Invariant [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (1 < \old(index) || ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && head == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && \old(index) == index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) || ((((((((1 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(index) <= index + 1) && #memory_$Pointer$[head][head + 4] == head) && #memory_$Pointer$[head][head + 4] == head) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2023-04-02 01:11:05,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((\old(len) == len && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) || (\old(len) <= len + 1 && \valid[head] == 1)) || ((!(head == #memory_$Pointer$[head][4]) && head == 0) && \valid[head] == 1) - InvariantResult [Line: 618]: Loop Invariant [2023-04-02 01:11:05,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,536 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((!(s == #memory_$Pointer$[s][4]) && i == 1) && len == 2) && s == 0) || (((((((((2 <= new_data && unknown-#memory_int-unknown[s][0] <= 2) && !(s == #memory_$Pointer$[s][4])) && i <= 0) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && new_data <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0)) || ((((((!(s == #memory_$Pointer$[s][4]) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && i == 0) && 3 == new_data) && s == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant [2023-04-02 01:11:05,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] Derived loop invariant: ((((forall v_main_~s~0.offset_BEFORE_CALL_5 : int, v_main_~s~0.base_BEFORE_CALL_5 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_5][v_main_~s~0.offset_BEFORE_CALL_5] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_5][v_main_~s~0.offset_BEFORE_CALL_5]) || (((index <= 0 && 1 <= \old(index)) && head == #memory_$Pointer$[head][head + 4]) && #memory_$Pointer$[head][head + 4] == head)) || 2 <= \old(index)) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 4]] == 3) || v_main_~s~0.base_BEFORE_CALL_3 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 4])) || ((\old(index) == index && head == head) && head == head) - InvariantResult [Line: 622]: Loop Invariant [2023-04-02 01:11:05,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:11:05,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:11:05,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((2 <= new_data && unknown-#memory_int-unknown[s][0] <= 2) && !(s == #memory_$Pointer$[s][4])) && i == 1) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && new_data <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0) || (((((((((((2 <= new_data && unknown-#memory_int-unknown[s][0] <= 2) && !(s == #memory_$Pointer$[s][4])) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && new_data <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && 2 == expected) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0) || (((((((((2 <= new_data && !(s == #memory_$Pointer$[s][4])) && 2 <= unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[s][s] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && new_data <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && i == 0) && s == 0)) && i <= 0) RESULT: Ultimate proved your program to be correct! [2023-04-02 01:11:05,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...