/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/sll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:07:52,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:07:52,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:07:52,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:07:52,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:07:52,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:07:52,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:07:52,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:07:52,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:07:52,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:07:52,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:07:52,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:07:52,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:07:52,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:07:52,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:07:52,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:07:52,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:07:52,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:07:52,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:07:52,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:07:52,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:07:52,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:07:52,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:07:52,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:07:52,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:07:52,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:07:52,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:07:52,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:07:52,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:07:52,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:07:52,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:07:52,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:07:52,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:07:52,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:07:52,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:07:52,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:07:52,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:07:52,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:07:52,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:07:52,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:07:52,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:07:52,865 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:07:52,890 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:07:52,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:07:52,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:07:52,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:07:52,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:07:52,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:07:52,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:07:52,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:07:52,891 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:07:52,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:07:52,892 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:07:52,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:07:52,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:07:52,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:07:52,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:07:52,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:07:52,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:07:52,894 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:07:52,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:07:52,894 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:07:52,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:07:52,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:07:52,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:07:52,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:07:52,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:07:52,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:07:52,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:07:52,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:07:52,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:07:52,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:07:52,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:07:52,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:07:52,897 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:07:52,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:07:52,897 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:07:52,897 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:07:53,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:07:53,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:07:53,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:07:53,087 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:07:53,088 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:07:53,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-04-02 01:07:54,211 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:07:54,449 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:07:54,449 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-04-02 01:07:54,467 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748b078b0/f290a5c14a0649eea87b26a5799bf3f5/FLAG2f28502d2 [2023-04-02 01:07:54,482 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748b078b0/f290a5c14a0649eea87b26a5799bf3f5 [2023-04-02 01:07:54,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:07:54,486 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:07:54,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:07:54,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:07:54,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:07:54,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a52bb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54, skipping insertion in model container [2023-04-02 01:07:54,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:07:54,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:07:54,742 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/sll2c_update_all_reverse.i[24436,24449] [2023-04-02 01:07:54,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:07:54,757 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:07:54,795 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/sll2c_update_all_reverse.i[24436,24449] [2023-04-02 01:07:54,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:07:54,819 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:07:54,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54 WrapperNode [2023-04-02 01:07:54,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:07:54,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:07:54,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:07:54,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:07:54,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,870 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:07:54,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:07:54,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:07:54,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:07:54,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (1/1) ... [2023-04-02 01:07:54,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:07:54,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:07:54,939 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:07:54,955 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:07:54,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:07:54,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2023-04-02 01:07:54,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:07:54,979 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 01:07:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 01:07:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 01:07:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 01:07:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 01:07:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 01:07:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 01:07:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 01:07:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 01:07:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 01:07:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 01:07:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 01:07:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 01:07:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 01:07:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 01:07:54,985 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 01:07:54,985 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 01:07:54,985 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 01:07:54,985 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 01:07:54,985 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 01:07:54,986 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 01:07:54,987 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 01:07:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 01:07:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 01:07:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 01:07:54,991 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 01:07:54,991 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 01:07:54,991 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 01:07:54,991 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 01:07:54,991 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-02 01:07:54,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 01:07:54,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 01:07:54,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:07:54,992 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2023-04-02 01:07:54,993 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2023-04-02 01:07:54,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 01:07:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:07:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2023-04-02 01:07:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:07:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2023-04-02 01:07:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:07:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:07:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:07:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:07:55,241 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:07:55,242 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:07:55,269 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 01:07:55,369 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:07:55,373 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:07:55,373 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-02 01:07:55,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:07:55 BoogieIcfgContainer [2023-04-02 01:07:55,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:07:55,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:07:55,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:07:55,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:07:55,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:07:54" (1/3) ... [2023-04-02 01:07:55,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7628881e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:07:55, skipping insertion in model container [2023-04-02 01:07:55,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:07:54" (2/3) ... [2023-04-02 01:07:55,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7628881e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:07:55, skipping insertion in model container [2023-04-02 01:07:55,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:07:55" (3/3) ... [2023-04-02 01:07:55,380 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2023-04-02 01:07:55,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:07:55,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:07:55,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:07:55,439 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;@1fdb697c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:07:55,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:07:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-02 01:07:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-02 01:07:55,448 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:07:55,448 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] [2023-04-02 01:07:55,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:07:55,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:07:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1043724773, now seen corresponding path program 1 times [2023-04-02 01:07:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:07:55,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570536740] [2023-04-02 01:07:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:07:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:55,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:07:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:07:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:07:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 01:07:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,015 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:07:56,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:07:56,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570536740] [2023-04-02 01:07:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570536740] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:07:56,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:07:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:07:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143981222] [2023-04-02 01:07:56,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:07:56,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:07:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:07:56,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:07:56,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:07:56,065 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:07:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:07:56,462 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2023-04-02 01:07:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:07:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2023-04-02 01:07:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:07:56,469 INFO L225 Difference]: With dead ends: 105 [2023-04-02 01:07:56,469 INFO L226 Difference]: Without dead ends: 46 [2023-04-02 01:07:56,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:07:56,473 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:07:56,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 16 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 01:07:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-04-02 01:07:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-04-02 01:07:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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:07:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-04-02 01:07:56,504 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2023-04-02 01:07:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:07:56,504 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-04-02 01:07:56,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:07:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-04-02 01:07:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 01:07:56,506 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:07:56,506 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 01:07:56,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:07:56,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:07:56,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:07:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash 311166707, now seen corresponding path program 1 times [2023-04-02 01:07:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:07:56,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223402946] [2023-04-02 01:07:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:07:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:07:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:07:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:07:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:07:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-04-02 01:07:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 01:07:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:07:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223402946] [2023-04-02 01:07:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223402946] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:07:56,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:07:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:07:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31765682] [2023-04-02 01:07:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:07:56,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:07:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:07:56,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:07:56,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:07:56,748 INFO L87 Difference]: Start difference. First operand 44 states and 49 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 01:07:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:07:56,906 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2023-04-02 01:07:56,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:07:56,906 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2023-04-02 01:07:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:07:56,907 INFO L225 Difference]: With dead ends: 67 [2023-04-02 01:07:56,907 INFO L226 Difference]: Without dead ends: 54 [2023-04-02 01:07:56,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-04-02 01:07:56,908 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:07:56,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 7 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:07:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-04-02 01:07:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2023-04-02 01:07:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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:07:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-04-02 01:07:56,915 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 40 [2023-04-02 01:07:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:07:56,916 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-04-02 01:07:56,916 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 01:07:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-04-02 01:07:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 01:07:56,917 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:07:56,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:07:56,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 01:07:56,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:07:56,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:07:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1308016445, now seen corresponding path program 1 times [2023-04-02 01:07:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:07:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976993843] [2023-04-02 01:07:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:07:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:07:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:07:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:07:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:07:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:07:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-04-02 01:07:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 01:07:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:07:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976993843] [2023-04-02 01:07:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976993843] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:07:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139771548] [2023-04-02 01:07:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:57,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:07:57,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:07:57,070 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:07:57,085 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:07:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:07:57,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:07:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 01:07:57,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:07:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139771548] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:07:57,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 01:07:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-04-02 01:07:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812051681] [2023-04-02 01:07:57,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:07:57,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:07:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:07:57,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:07:57,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:07:57,361 INFO L87 Difference]: Start difference. First operand 45 states and 50 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-02 01:07:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:07:57,413 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2023-04-02 01:07:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:07:57,413 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2023-04-02 01:07:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:07:57,415 INFO L225 Difference]: With dead ends: 79 [2023-04-02 01:07:57,415 INFO L226 Difference]: Without dead ends: 58 [2023-04-02 01:07:57,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 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:07:57,416 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 176 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:07:57,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 176 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:07:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-04-02 01:07:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-04-02 01:07:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 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:07:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-04-02 01:07:57,424 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 48 [2023-04-02 01:07:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:07:57,424 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-04-02 01:07:57,424 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-02 01:07:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-04-02 01:07:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-02 01:07:57,425 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:07:57,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:07:57,445 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:07:57,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:07:57,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:07:57,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:07:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 716210923, now seen corresponding path program 1 times [2023-04-02 01:07:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:07:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67493755] [2023-04-02 01:07:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:07:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:07:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:07:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:07:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:07:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:07:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-04-02 01:07:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-02 01:07:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:07:57,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67493755] [2023-04-02 01:07:57,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67493755] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:07:57,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155806284] [2023-04-02 01:07:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:57,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:07:57,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:07:57,823 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:07:57,858 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:07:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:57,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 01:07:57,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:07:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-02 01:07:58,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:07:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-02 01:07:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155806284] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:07:58,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:07:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 10 [2023-04-02 01:07:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664900481] [2023-04-02 01:07:58,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:07:58,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 01:07:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:07:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 01:07:58,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 01:07:58,050 INFO L87 Difference]: Start difference. First operand 50 states and 57 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, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-04-02 01:07:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:07:58,235 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-04-02 01:07:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:07:58,235 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, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 49 [2023-04-02 01:07:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:07:58,236 INFO L225 Difference]: With dead ends: 73 [2023-04-02 01:07:58,236 INFO L226 Difference]: Without dead ends: 60 [2023-04-02 01:07:58,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-04-02 01:07:58,237 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 100 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:07:58,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 9 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:07:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-02 01:07:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2023-04-02 01:07:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 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:07:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-04-02 01:07:58,244 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2023-04-02 01:07:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:07:58,244 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-04-02 01:07:58,245 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, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-04-02 01:07:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-04-02 01:07:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-04-02 01:07:58,245 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:07:58,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:07:58,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 01:07:58,450 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:07:58,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:07:58,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:07:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2051292363, now seen corresponding path program 2 times [2023-04-02 01:07:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:07:58,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404702326] [2023-04-02 01:07:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:07:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:07:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:07:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:07:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:07:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:07:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:07:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:07:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-02 01:07:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:07:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404702326] [2023-04-02 01:07:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404702326] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:07:58,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:07:58,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 01:07:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983720302] [2023-04-02 01:07:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:07:58,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 01:07:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:07:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 01:07:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 01:07:58,645 INFO L87 Difference]: Start difference. First operand 52 states and 59 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, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-02 01:07:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:07:58,910 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-04-02 01:07:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 01:07:58,910 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, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2023-04-02 01:07:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:07:58,911 INFO L225 Difference]: With dead ends: 75 [2023-04-02 01:07:58,911 INFO L226 Difference]: Without dead ends: 63 [2023-04-02 01:07:58,911 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:07:58,912 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:07:58,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 13 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:07:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-02 01:07:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2023-04-02 01:07:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 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:07:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-04-02 01:07:58,919 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 57 [2023-04-02 01:07:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:07:58,919 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-04-02 01:07:58,919 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, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-02 01:07:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2023-04-02 01:07:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-04-02 01:07:58,920 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:07:58,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:07:58,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 01:07:58,920 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:07:58,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:07:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1040826720, now seen corresponding path program 1 times [2023-04-02 01:07:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:07:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355766061] [2023-04-02 01:07:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:07:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:07:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:07:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:07:59,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:07:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:00,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:08:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:08:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:00,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:08:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 01:08:00,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355766061] [2023-04-02 01:08:00,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355766061] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942858272] [2023-04-02 01:08:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:00,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:00,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:00,848 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:08:00,868 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:08:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:01,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 118 conjunts are in the unsatisfiable core [2023-04-02 01:08:01,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:01,050 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:08:01,218 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:08:01,219 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:08:01,265 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 11 treesize of output 7 [2023-04-02 01:08:01,312 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:08:01,313 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 19 treesize of output 22 [2023-04-02 01:08:01,582 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 25 treesize of output 17 [2023-04-02 01:08:01,590 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-04-02 01:08:01,591 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2023-04-02 01:08:01,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-04-02 01:08:01,729 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:08:01,730 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 36 treesize of output 37 [2023-04-02 01:08:01,912 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_743 (Array Int Int))) (= (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| v_ArrVal_743) |c_#memory_int|)) (exists ((v_ArrVal_741 Int) (sll_circular_update_at_~head.offset Int) (v_ArrVal_744 Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 v_ArrVal_744))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 v_ArrVal_741))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))))) is different from true [2023-04-02 01:08:01,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:08:01,937 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:08:01,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:08:01,944 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 39 treesize of output 34 [2023-04-02 01:08:01,949 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 24 treesize of output 26 [2023-04-02 01:08:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-04-02 01:08:02,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:02,727 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_main_~s~0.base)) (.cse3 (select |c_#memory_$Pointer$.offset| c_main_~s~0.base)) (.cse0 (* 2 c_main_~len~0))) (and (forall ((v_sll_circular_update_at_~head.offset_12 Int)) (or (< v_sll_circular_update_at_~head.offset_12 c_main_~s~0.offset) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 Int) (v_ArrVal_755 Int)) (<= .cse0 (+ (let ((.cse2 (+ v_sll_circular_update_at_~head.offset_12 4))) (select (select (store |c_#memory_int| c_main_~s~0.base v_ArrVal_754) (select (store .cse1 .cse2 v_ArrVal_756) c_main_~s~0.offset)) (+ (select (store .cse3 .cse2 v_ArrVal_755) c_main_~s~0.offset) 4))) 1))))) (forall ((v_sll_circular_update_at_~head.offset_12 Int)) (or (< v_sll_circular_update_at_~head.offset_12 c_main_~s~0.offset) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 Int) (v_ArrVal_755 Int)) (< (let ((.cse4 (+ v_sll_circular_update_at_~head.offset_12 4))) (select (select (store |c_#memory_int| c_main_~s~0.base v_ArrVal_754) (select (store .cse1 .cse4 v_ArrVal_756) c_main_~s~0.offset)) (+ (select (store .cse3 .cse4 v_ArrVal_755) c_main_~s~0.offset) 4))) .cse0)))))) is different from false [2023-04-02 01:08:02,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942858272] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:02,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:08:02,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 57 [2023-04-02 01:08:02,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944386273] [2023-04-02 01:08:02,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:08:02,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-04-02 01:08:02,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:02,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-04-02 01:08:02,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3552, Unknown=39, NotChecked=242, Total=4032 [2023-04-02 01:08:02,733 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 44 states have internal predecessors, (79), 10 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-02 01:08:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:05,419 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2023-04-02 01:08:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-04-02 01:08:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 44 states have internal predecessors, (79), 10 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) Word has length 58 [2023-04-02 01:08:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:05,420 INFO L225 Difference]: With dead ends: 121 [2023-04-02 01:08:05,421 INFO L226 Difference]: Without dead ends: 119 [2023-04-02 01:08:05,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=595, Invalid=8451, Unknown=82, NotChecked=378, Total=9506 [2023-04-02 01:08:05,423 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 266 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:05,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 49 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2574 Invalid, 0 Unknown, 136 Unchecked, 1.2s Time] [2023-04-02 01:08:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-04-02 01:08:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2023-04-02 01:08:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 78 states have internal predecessors, (86), 14 states have call successors, (14), 7 states have call predecessors, (14), 12 states have return successors, (24), 13 states have call predecessors, (24), 13 states have call successors, (24) [2023-04-02 01:08:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2023-04-02 01:08:05,435 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 58 [2023-04-02 01:08:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:05,436 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2023-04-02 01:08:05,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 44 states have internal predecessors, (79), 10 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-02 01:08:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2023-04-02 01:08:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-04-02 01:08:05,437 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:08:05,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:08:05,459 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:08:05,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:05,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:08:05,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:08:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash 218837141, now seen corresponding path program 2 times [2023-04-02 01:08:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:08:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578815845] [2023-04-02 01:08:05,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:08:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:08:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:08:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:08:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:08:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:08:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-02 01:08:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578815845] [2023-04-02 01:08:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578815845] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904051900] [2023-04-02 01:08:05,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:08:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:05,781 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:08:05,783 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:08:05,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:08:05,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:08:05,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:08:05,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-02 01:08:05,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-02 01:08:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904051900] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:06,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:08:06,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 15 [2023-04-02 01:08:06,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768454642] [2023-04-02 01:08:06,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:08:06,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:08:06,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:06,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:08:06,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-04-02 01:08:06,095 INFO L87 Difference]: Start difference. First operand 99 states and 124 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, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-02 01:08:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:06,133 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2023-04-02 01:08:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 01:08:06,133 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, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2023-04-02 01:08:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:06,134 INFO L225 Difference]: With dead ends: 137 [2023-04-02 01:08:06,134 INFO L226 Difference]: Without dead ends: 95 [2023-04-02 01:08:06,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 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:08:06,135 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:06,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 142 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:08:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-04-02 01:08:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-04-02 01:08:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 74 states have internal predecessors, (80), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2023-04-02 01:08:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2023-04-02 01:08:06,144 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 59 [2023-04-02 01:08:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:06,145 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2023-04-02 01:08:06,145 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, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-02 01:08:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2023-04-02 01:08:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-04-02 01:08:06,145 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:08:06,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:08:06,159 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:08:06,349 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:08:06,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:08:06,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:08:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash 372071330, now seen corresponding path program 3 times [2023-04-02 01:08:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:08:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009539191] [2023-04-02 01:08:06,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:08:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:08:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:08:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:08:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:08:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 01:08:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-02 01:08:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009539191] [2023-04-02 01:08:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009539191] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196018576] [2023-04-02 01:08:06,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:08:06,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:06,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:06,494 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:08:06,495 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:08:06,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 01:08:06,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:08:06,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:08:06,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 01:08:06,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 01:08:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196018576] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:06,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:08:06,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2023-04-02 01:08:06,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213975436] [2023-04-02 01:08:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:08:06,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:08:06,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:06,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:08:06,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:08:06,830 INFO L87 Difference]: Start difference. First operand 95 states and 116 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, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 01:08:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:06,855 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2023-04-02 01:08:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:08:06,856 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, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-04-02 01:08:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:06,857 INFO L225 Difference]: With dead ends: 116 [2023-04-02 01:08:06,857 INFO L226 Difference]: Without dead ends: 97 [2023-04-02 01:08:06,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:08:06,858 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:06,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 161 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:08:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-02 01:08:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-04-02 01:08:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 74 states have internal predecessors, (80), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2023-04-02 01:08:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2023-04-02 01:08:06,867 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 59 [2023-04-02 01:08:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:06,868 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2023-04-02 01:08:06,868 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, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 01:08:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2023-04-02 01:08:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-04-02 01:08:06,869 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:08:06,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:08:06,881 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:08:07,075 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:08:07,077 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:08:07,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:08:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 856277198, now seen corresponding path program 4 times [2023-04-02 01:08:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:08:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638545573] [2023-04-02 01:08:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:08:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:08:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:08:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:08:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-04-02 01:08:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 01:08:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 01:08:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638545573] [2023-04-02 01:08:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638545573] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705871666] [2023-04-02 01:08:07,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 01:08:07,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:07,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:07,221 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:08:07,222 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:08:07,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 01:08:07,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:08:07,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:08:07,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-02 01:08:07,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 01:08:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705871666] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:08:07,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:08:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2023-04-02 01:08:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684135667] [2023-04-02 01:08:07,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:08:07,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 01:08:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:07,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 01:08:07,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-04-02 01:08:07,538 INFO L87 Difference]: Start difference. First operand 95 states and 116 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, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2023-04-02 01:08:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:07,922 INFO L93 Difference]: Finished difference Result 139 states and 166 transitions. [2023-04-02 01:08:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 01:08:07,922 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, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 59 [2023-04-02 01:08:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:07,923 INFO L225 Difference]: With dead ends: 139 [2023-04-02 01:08:07,923 INFO L226 Difference]: Without dead ends: 98 [2023-04-02 01:08:07,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 125 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:08:07,926 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 125 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:07,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 13 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:08:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-04-02 01:08:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-04-02 01:08:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 70 states have internal predecessors, (75), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (18), 13 states have call predecessors, (18), 13 states have call successors, (18) [2023-04-02 01:08:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2023-04-02 01:08:07,943 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 59 [2023-04-02 01:08:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:07,944 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2023-04-02 01:08:07,944 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, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2023-04-02 01:08:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2023-04-02 01:08:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-04-02 01:08:07,944 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:08:07,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:08:07,973 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:08:08,154 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:08:08,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:08:08,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:08:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 547250552, now seen corresponding path program 5 times [2023-04-02 01:08:08,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:08:08,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115420733] [2023-04-02 01:08:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:08,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:08:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:08:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:08:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-04-02 01:08:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-04-02 01:08:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 01:08:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 01:08:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-02 01:08:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115420733] [2023-04-02 01:08:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115420733] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693597134] [2023-04-02 01:08:08,315 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-02 01:08:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:08,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:08,321 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:08:08,324 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:08:08,533 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-04-02 01:08:08,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:08:08,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:08:08,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-02 01:08:08,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-02 01:08:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693597134] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:08,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:08:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 13 [2023-04-02 01:08:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270687014] [2023-04-02 01:08:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:08:08,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:08:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:08,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:08:08,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:08:08,654 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-02 01:08:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:08,678 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2023-04-02 01:08:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:08:08,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 66 [2023-04-02 01:08:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:08,680 INFO L225 Difference]: With dead ends: 124 [2023-04-02 01:08:08,680 INFO L226 Difference]: Without dead ends: 82 [2023-04-02 01:08:08,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:08:08,682 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:08,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 154 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:08:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-04-02 01:08:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-04-02 01:08:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 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:08:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2023-04-02 01:08:08,693 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 66 [2023-04-02 01:08:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:08,693 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2023-04-02 01:08:08,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-02 01:08:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2023-04-02 01:08:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-04-02 01:08:08,694 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:08:08,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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:08:08,710 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:08:08,900 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:08:08,900 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:08:08,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:08:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1289704296, now seen corresponding path program 6 times [2023-04-02 01:08:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:08:08,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463842057] [2023-04-02 01:08:08,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:08:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:08:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:08:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:08:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:08,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:08:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 01:08:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-04-02 01:08:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-02 01:08:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463842057] [2023-04-02 01:08:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463842057] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36635457] [2023-04-02 01:08:09,022 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-02 01:08:09,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:09,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:09,038 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:08:09,039 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:08:09,418 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-04-02 01:08:09,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:08:09,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:08:09,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 01:08:09,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-02 01:08:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36635457] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:08:09,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:08:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2023-04-02 01:08:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139390648] [2023-04-02 01:08:09,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:08:09,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 01:08:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:09,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 01:08:09,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:08:09,624 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 7 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-04-02 01:08:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:09,966 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2023-04-02 01:08:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 01:08:09,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 7 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 67 [2023-04-02 01:08:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:09,967 INFO L225 Difference]: With dead ends: 96 [2023-04-02 01:08:09,967 INFO L226 Difference]: Without dead ends: 63 [2023-04-02 01:08:09,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2023-04-02 01:08:09,968 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 136 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:09,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 13 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:08:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-02 01:08:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-04-02 01:08:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 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:08:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-04-02 01:08:09,979 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 67 [2023-04-02 01:08:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:09,979 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-04-02 01:08:09,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 7 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-04-02 01:08:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-04-02 01:08:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-04-02 01:08:09,982 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:08:09,982 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, 1, 1, 1, 1, 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:08:09,998 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:08:10,189 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:08:10,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:08:10,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:08:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1729031691, now seen corresponding path program 1 times [2023-04-02 01:08:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:08:10,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786602860] [2023-04-02 01:08:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:08:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:08:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:08:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:08:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:08:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:08:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 01:08:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 01:08:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:10,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786602860] [2023-04-02 01:08:10,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786602860] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:10,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882205840] [2023-04-02 01:08:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:10,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:10,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:10,911 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:08:10,912 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:08:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:11,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 57 conjunts are in the unsatisfiable core [2023-04-02 01:08:11,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:11,221 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 13 treesize of output 9 [2023-04-02 01:08:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 01:08:11,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:11,911 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 46 treesize of output 40 [2023-04-02 01:08:11,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:08:11,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:08:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 01:08:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882205840] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:08:12,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:08:12,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 14] total 48 [2023-04-02 01:08:12,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014470064] [2023-04-02 01:08:12,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:08:12,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-04-02 01:08:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-04-02 01:08:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2108, Unknown=0, NotChecked=0, Total=2256 [2023-04-02 01:08:12,078 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 48 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 14 states have call successors, (22), 5 states have call predecessors, (22), 10 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2023-04-02 01:08:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:13,380 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2023-04-02 01:08:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-02 01:08:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 14 states have call successors, (22), 5 states have call predecessors, (22), 10 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) Word has length 68 [2023-04-02 01:08:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:13,381 INFO L225 Difference]: With dead ends: 76 [2023-04-02 01:08:13,381 INFO L226 Difference]: Without dead ends: 72 [2023-04-02 01:08:13,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=424, Invalid=4832, Unknown=0, NotChecked=0, Total=5256 [2023-04-02 01:08:13,383 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 227 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:13,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 61 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1858 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 01:08:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-04-02 01:08:13,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2023-04-02 01:08:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 51 states have internal predecessors, (53), 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:08:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-04-02 01:08:13,390 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 68 [2023-04-02 01:08:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:13,390 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-04-02 01:08:13,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 14 states have call successors, (22), 5 states have call predecessors, (22), 10 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2023-04-02 01:08:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-04-02 01:08:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-04-02 01:08:13,391 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:08:13,391 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, 1, 1, 1, 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:08:13,399 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:08:13,591 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:08:13,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:08:13,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:08:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash 185101962, now seen corresponding path program 2 times [2023-04-02 01:08:13,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:08:13,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306112612] [2023-04-02 01:08:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:08:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:08:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:08:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:08:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:08:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:08:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 01:08:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:08:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:08:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 01:08:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:08:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-02 01:08:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:08:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306112612] [2023-04-02 01:08:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306112612] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843387961] [2023-04-02 01:08:13,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:08:13,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:08:13,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:08:13,755 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:08:13,784 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:08:13,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:08:13,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:08:13,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:08:13,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:08:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-02 01:08:14,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:08:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-02 01:08:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843387961] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:08:14,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:08:14,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 15 [2023-04-02 01:08:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775729409] [2023-04-02 01:08:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:08:14,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:08:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:08:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:08:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-04-02 01:08:14,123 INFO L87 Difference]: Start difference. First operand 68 states and 73 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-02 01:08:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:08:14,187 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-04-02 01:08:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 01:08:14,187 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 69 [2023-04-02 01:08:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:08:14,189 INFO L225 Difference]: With dead ends: 85 [2023-04-02 01:08:14,189 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 01:08:14,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 143 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:08:14,190 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:08:14,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 211 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:08:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 01:08:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 01:08:14,191 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:08:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 01:08:14,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-04-02 01:08:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:08:14,191 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 01:08:14,191 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-02 01:08:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 01:08:14,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 01:08:14,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 01:08:14,216 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:08:14,400 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:08:14,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 01:08:15,027 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-04-02 01:08:15,028 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 571 573) the Hoare annotation is: true [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L902 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: true [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2023-04-02 01:08:15,028 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:08:15,028 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-04-02 01:08:15,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:08:15,028 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:08:15,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 620 639) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 620 639) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 620 639) 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:08:15,029 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L895 garLoopResultBuilder]: At program point L631(line 631) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| main_~s~0.base) 4))) (let ((.cse0 (<= 2 main_~new_data~0)) (.cse1 (<= .cse8 2)) (.cse4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) 4)) (.cse2 (= main_~len~0 2)) (.cse3 (<= main_~new_data~0 2)) (.cse5 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse6 (<= 2 .cse8)) (.cse7 (= main_~s~0.offset 0))) (or (and .cse0 .cse1 (<= main_~expected~0 3) (= main_~i~0 1) .cse2 .cse3 (= .cse4 3) .cse5 .cse6 (<= 3 main_~expected~0) .cse7) (and .cse0 (<= .cse4 3) .cse1 (<= 3 .cse4) .cse2 .cse3 (= main_~i~0 0) .cse5 (= 2 main_~expected~0) .cse6 .cse7)))) [2023-04-02 01:08:15,029 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 633) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse2 (not (= .cse5 main_~s~0.base))) (.cse3 (= main_~s~0.offset 0))) (or (and (<= 3 main_~new_data~0) (<= main_~new_data~0 3) (= main_~i~0 1) .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (select (select |#memory_int| .cse5) 4))) (and (<= 2 main_~new_data~0) (<= .cse4 3) (<= 3 .cse4) .cse0 (<= main_~new_data~0 2) (= main_~i~0 0) .cse1 .cse2 .cse3))))) [2023-04-02 01:08:15,029 INFO L899 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L899 garLoopResultBuilder]: For program point L627-1(lines 625 628) no Hoare annotation was computed. [2023-04-02 01:08:15,029 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| main_~s~0.base) 4)) (.cse10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) 4))) (let ((.cse0 (<= 2 main_~new_data~0)) (.cse1 (<= .cse10 3)) (.cse2 (<= .cse9 2)) (.cse3 (<= 3 .cse10)) (.cse4 (= main_~len~0 2)) (.cse5 (<= main_~new_data~0 2)) (.cse6 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse7 (<= 2 .cse9)) (.cse8 (= main_~s~0.offset 0))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 main_~expected~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= main_~i~0 0) .cse6 .cse7 .cse8)) (<= main_~i~0 0)) (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 1) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2023-04-02 01:08:15,029 INFO L895 garLoopResultBuilder]: At program point L629-4(lines 629 634) the Hoare annotation is: (= main_~len~0 2) [2023-04-02 01:08:15,029 INFO L895 garLoopResultBuilder]: At program point L623(line 623) 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:08:15,030 INFO L895 garLoopResultBuilder]: At program point L625-2(lines 625 628) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))) (let ((.cse7 (select (select |#memory_int| .cse8) 4))) (let ((.cse2 (not (= .cse8 main_~s~0.base))) (.cse4 (<= .cse7 3)) (.cse5 (<= 3 .cse7)) (.cse0 (= main_~len~0 2)) (.cse1 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse3 (= main_~s~0.offset 0))) (or (and (= main_~i~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 (= main_~i~0 0) .cse1 (= 3 main_~new_data~0) .cse2 .cse3) (let ((.cse6 (select (select |#memory_int| main_~s~0.base) 4))) (and (<= 2 main_~new_data~0) .cse4 (<= .cse6 2) .cse5 (<= main_~i~0 0) .cse0 (<= main_~new_data~0 2) .cse1 (<= 2 .cse6) .cse3)))))) [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point L625-3(lines 625 628) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L895 garLoopResultBuilder]: At program point ERROR(lines 620 639) the Hoare annotation is: false [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point sll_circular_update_atEXIT(lines 613 619) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point sll_circular_update_atFINAL(lines 613 619) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 613 619) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2023-04-02 01:08:15,030 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse3 (<= (+ sll_circular_update_at_~index 1) |sll_circular_update_at_#in~index|)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse4 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data)) (.cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (<= 2 |sll_circular_update_at_#in~index|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (<= 1 |sll_circular_update_at_#in~index|) .cse1 .cse2 .cse3) (and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) .cse0 .cse4 .cse1 .cse2 (= |sll_circular_update_at_#in~index| sll_circular_update_at_~index) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|)))) [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point L596-2(lines 595 605) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point sll_circular_destroyEXIT(lines 595 605) no Hoare annotation was computed. [2023-04-02 01:08:15,030 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 595 605) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-04-02 01:08:15,030 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point sll_circular_createFINAL(lines 583 594) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (or (<= 3 |sll_circular_create_#in~len|) (and (= sll_circular_create_~head~0.offset 0) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (select |#valid| sll_circular_create_~last~0.base) 1) (< sll_circular_create_~len 3))) [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point sll_circular_createEXIT(lines 583 594) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 583 594) 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:08:15,031 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_circular_create_#in~len| sll_circular_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-04-02 01:08:15,031 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= sll_circular_create_~head~0.offset 0)) (.cse1 (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base))) (or (<= 3 |sll_circular_create_#in~len|) (and (= sll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) 0)) .cse0 (= (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) 0) 0) (<= sll_circular_create_~len 1) (not .cse1)) (and .cse0 .cse1 (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (select |#valid| sll_circular_create_~last~0.base) 1)))) [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point sll_circular_get_data_atEXIT(lines 606 612) no Hoare annotation was computed. [2023-04-02 01:08:15,031 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (or (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3))) (or (< 0 v_main_~s~0.offset_BEFORE_CALL_3) (not (= (select (select |#memory_int| .cse0) (+ (select (select |#memory_$Pointer$.offset| 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 .cse0) (< v_main_~s~0.offset_BEFORE_CALL_3 0)))) (and (<= sll_circular_get_data_at_~index 0) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (<= 1 |sll_circular_get_data_at_#in~index|) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base)) (forall ((v_main_~s~0.offset_BEFORE_CALL_5 Int) (v_main_~s~0.base_BEFORE_CALL_5 Int)) (not (= 2 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_5) (+ v_main_~s~0.offset_BEFORE_CALL_5 4))))) (and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|)) (<= 2 |sll_circular_get_data_at_#in~index|)) [2023-04-02 01:08:15,031 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2023-04-02 01:08:15,032 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 606 612) the Hoare annotation is: true [2023-04-02 01:08:15,032 INFO L899 garLoopResultBuilder]: For program point sll_circular_get_data_atFINAL(lines 606 612) no Hoare annotation was computed. [2023-04-02 01:08:15,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:08:15,032 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-02 01:08:15,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:08:15,032 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 01:08:15,034 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1] [2023-04-02 01:08:15,035 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 01:08:15,039 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,063 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,063 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,066 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,066 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,067 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,081 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,091 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:08:15,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,091 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:08:15,092 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:08:15,092 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,092 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:08:15,092 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:08:15,092 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:08:15,092 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,092 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:08:15,092 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:08:15,092 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:08:15,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,093 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:08:15,093 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:08:15,093 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:08:15,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,093 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:08:15,094 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:08:15,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,094 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:08:15,094 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:08:15,094 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:08:15,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,094 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:08:15,094 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:08:15,094 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:08:15,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,094 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:08:15,094 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:08:15,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,098 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,098 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,098 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,113 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,113 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,113 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,117 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,117 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,117 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,117 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:08:15 BoogieIcfgContainer [2023-04-02 01:08:15,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 01:08:15,122 INFO L158 Benchmark]: Toolchain (without parser) took 20635.24ms. Allocated memory was 174.1MB in the beginning and 457.2MB in the end (delta: 283.1MB). Free memory was 130.8MB in the beginning and 350.9MB in the end (delta: -220.1MB). Peak memory consumption was 259.6MB. Max. memory is 8.0GB. [2023-04-02 01:08:15,122 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 01:08:15,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.92ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 113.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-02 01:08:15,123 INFO L158 Benchmark]: Boogie Preprocessor took 66.88ms. Allocated memory is still 174.1MB. Free memory was 113.2MB in the beginning and 110.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-04-02 01:08:15,123 INFO L158 Benchmark]: RCFGBuilder took 487.63ms. Allocated memory is still 174.1MB. Free memory was 110.2MB in the beginning and 87.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-04-02 01:08:15,123 INFO L158 Benchmark]: TraceAbstraction took 19744.64ms. Allocated memory was 174.1MB in the beginning and 457.2MB in the end (delta: 283.1MB). Free memory was 86.4MB in the beginning and 350.9MB in the end (delta: -264.5MB). Peak memory consumption was 214.5MB. Max. memory is 8.0GB. [2023-04-02 01:08:15,124 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 174.1MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 330.92ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 113.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.88ms. Allocated memory is still 174.1MB. Free memory was 113.2MB in the beginning and 110.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 487.63ms. Allocated memory is still 174.1MB. Free memory was 110.2MB in the beginning and 87.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 19744.64ms. Allocated memory was 174.1MB in the beginning and 457.2MB in the end (delta: 283.1MB). Free memory was 86.4MB in the beginning and 350.9MB in the end (delta: -264.5MB). Peak memory consumption was 214.5MB. 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$.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$.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$.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$.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$.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$.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$.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$.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$.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.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 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.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 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_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.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 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.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 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_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$.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$.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$.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 * 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: 637]: 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, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1218 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1202 mSDsluCounter, 1025 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 136 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 381 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6312 IncrementalHoareTripleChecker+Invalid, 6830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 381 mSolverCounterUnsat, 246 mSDtfsCounter, 6312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1149 SyntacticMatches, 27 SemanticMatches, 329 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3772 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=6, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 81 PreInvPairs, 119 NumberOfFragments, 855 HoareAnnotationTreeSize, 81 FomulaSimplifications, 3049 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 948 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1333 NumberOfCodeBlocks, 1330 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1798 ConstructedInterpolants, 21 QuantifiedInterpolants, 6885 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3721 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 31 InterpolantComputations, 8 PerfectInterpolantSequences, 585/700 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: 625]: Loop Invariant [2023-04-02 01:08:15,134 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((i == 1 && len == 2) && #memory_$Pointer$[s][0] == 0) && !(#memory_$Pointer$[s][0] == s)) && s == 0) || (((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3 && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && len == 2) && i == 0) && #memory_$Pointer$[s][0] == 0) && 3 == new_data) && !(#memory_$Pointer$[s][0] == s)) && s == 0)) || (((((((((2 <= new_data && unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && i <= 0) && len == 2) && new_data <= 2) && #memory_$Pointer$[s][0] == 0) && 2 <= unknown-#memory_int-unknown[s][4]) && s == 0) - InvariantResult [Line: 614]: Loop Invariant [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((2 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && index + 1 <= \old(index)) || (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(data) == data) && #memory_$Pointer$[head][head] == head) && head == #memory_$Pointer$[head][head]) && 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && index + 1 <= \old(index))) || ((((((head == head && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(data) == data) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(index) == index) && head == head) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2023-04-02 01:08:15,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (3 <= \old(len) || ((((last == #memory_$Pointer$[head][0] && head == 0) && #memory_$Pointer$[head][0] == 0) && len <= 1) && !(head == last))) || (((head == 0 && head == last) && \old(len) == len) && \valid[last] == 1) - InvariantResult [Line: 607]: Loop Invariant [2023-04-02 01:08:15,139 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:08:15,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,139 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:08:15,139 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:08:15,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,140 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:08:15,140 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:08:15,140 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:08:15,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,140 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:08:15,140 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:08:15,140 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:08:15,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,140 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:08:15,140 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:08:15,141 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:08:15,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,141 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:08:15,141 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:08:15,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,141 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:08:15,141 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:08:15,141 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:08:15,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,141 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:08:15,141 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:08:15,141 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:08:15,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,141 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:08:15,142 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] Derived loop invariant: ((((forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: ((0 < v_main_~s~0.offset_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3]][#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]) || v_main_~s~0.offset_BEFORE_CALL_3 < 0) || (((index <= 0 && head == #memory_$Pointer$[head][head]) && 1 <= \old(index)) && #memory_$Pointer$[head][head] == head)) || (forall v_main_~s~0.offset_BEFORE_CALL_5 : int, v_main_~s~0.base_BEFORE_CALL_5 : int :: !(2 == unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_5][v_main_~s~0.offset_BEFORE_CALL_5 + 4]))) || ((head == head && index == \old(index)) && head == head)) || 2 <= \old(index) - InvariantResult [Line: 629]: Loop Invariant [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:08:15,143 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[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && len == 2) && new_data <= 2) && #memory_$Pointer$[s][0] == 0) && 2 == expected) && 2 <= unknown-#memory_int-unknown[s][4]) && s == 0) || (((((((((2 <= new_data && unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && len == 2) && new_data <= 2) && i == 0) && #memory_$Pointer$[s][0] == 0) && 2 <= unknown-#memory_int-unknown[s][4]) && s == 0)) && i <= 0) || (((((((((2 <= new_data && unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && i == 1) && len == 2) && new_data <= 2) && #memory_$Pointer$[s][0] == 0) && 2 <= unknown-#memory_int-unknown[s][4]) && s == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2023-04-02 01:08:15,162 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...