/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-ext3-properties/sll_circular_traversal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:12:16,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:12:16,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:12:16,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:12:16,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:12:16,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:12:16,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:12:16,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:12:16,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:12:16,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:12:16,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:12:16,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:12:16,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:12:16,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:12:16,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:12:16,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:12:16,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:12:16,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:12:16,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:12:16,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:12:16,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:12:16,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:12:16,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:12:16,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:12:16,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:12:16,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:12:16,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:12:16,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:12:16,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:12:16,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:12:16,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:12:16,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:12:16,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:12:16,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:12:16,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:12:16,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:12:16,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:12:16,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:12:16,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:12:16,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:12:16,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:12:16,761 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:12:16,792 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:12:16,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:12:16,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:12:16,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:12:16,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:12:16,795 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:12:16,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:12:16,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:12:16,795 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:12:16,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:12:16,796 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:12:16,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:12:16,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:12:16,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:12:16,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:12:16,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:12:16,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:12:16,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:12:16,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:12:16,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:12:16,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:12:16,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:12:16,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:12:16,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:12:16,799 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:12:16,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:12:16,799 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:12:16,799 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:12:16,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:12:16,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:12:16,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:12:16,996 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:12:16,997 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:12:16,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-04-02 01:12:18,091 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:12:18,408 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:12:18,409 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-04-02 01:12:18,419 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7da2296/9740cb33b50c4c4da156c52b49ef49d0/FLAG46e1d10b3 [2023-04-02 01:12:18,433 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7da2296/9740cb33b50c4c4da156c52b49ef49d0 [2023-04-02 01:12:18,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:12:18,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:12:18,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:12:18,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:12:18,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:12:18,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e286c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18, skipping insertion in model container [2023-04-02 01:12:18,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:12:18,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:12:18,738 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-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-04-02 01:12:18,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:12:18,752 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:12:18,780 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-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-04-02 01:12:18,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:12:18,803 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:12:18,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18 WrapperNode [2023-04-02 01:12:18,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:12:18,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:12:18,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:12:18,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:12:18,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,852 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:12:18,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:12:18,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:12:18,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:12:18,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (1/1) ... [2023-04-02 01:12:18,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:12:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:18,886 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:12:18,913 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:12:18,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:12:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:12:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:12:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 01:12:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 01:12:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 01:12:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2023-04-02 01:12:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:12:18,929 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 01:12:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 01:12:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 01:12:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 01:12:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 01:12:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 01:12:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 01:12:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 01:12:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 01:12:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 01:12:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 01:12:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 01:12:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 01:12:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 01:12:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 01:12:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 01:12:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 01:12:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 01:12:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 01:12:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 01:12:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 01:12:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 01:12:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 01:12:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 01:12:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 01:12:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 01:12:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 01:12:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 01:12:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 01:12:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 01:12:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 01:12:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 01:12:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:12:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:12:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:12:18,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:12:19,185 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:12:19,187 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:12:19,220 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 01:12:19,316 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:12:19,321 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:12:19,321 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-02 01:12:19,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:12:19 BoogieIcfgContainer [2023-04-02 01:12:19,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:12:19,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:12:19,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:12:19,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:12:19,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:12:18" (1/3) ... [2023-04-02 01:12:19,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e20a50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:12:19, skipping insertion in model container [2023-04-02 01:12:19,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:12:18" (2/3) ... [2023-04-02 01:12:19,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e20a50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:12:19, skipping insertion in model container [2023-04-02 01:12:19,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:12:19" (3/3) ... [2023-04-02 01:12:19,328 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-04-02 01:12:19,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:12:19,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:12:19,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:12:19,376 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;@16a63a52, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:12:19,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:12:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 29 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:12:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 01:12:19,384 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:19,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:19,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:19,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash -608378732, now seen corresponding path program 1 times [2023-04-02 01:12:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181053702] [2023-04-02 01:12:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:19,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:19,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:19,644 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:12:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181053702] [2023-04-02 01:12:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181053702] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:12:19,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:12:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 01:12:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014082203] [2023-04-02 01:12:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:12:19,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 01:12:19,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 01:12:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 01:12:19,673 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 29 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 01:12:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:19,816 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-04-02 01:12:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 01:12:19,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-04-02 01:12:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:19,823 INFO L225 Difference]: With dead ends: 57 [2023-04-02 01:12:19,823 INFO L226 Difference]: Without dead ends: 28 [2023-04-02 01:12:19,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:12:19,828 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:19,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 7 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:12:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-02 01:12:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-02 01:12:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-04-02 01:12:19,853 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2023-04-02 01:12:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:19,854 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-04-02 01:12:19,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 01:12:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-04-02 01:12:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 01:12:19,854 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:19,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:19,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:12:19,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:19,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash -47266272, now seen corresponding path program 1 times [2023-04-02 01:12:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104161607] [2023-04-02 01:12:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:20,108 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:12:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104161607] [2023-04-02 01:12:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104161607] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:12:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:12:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:12:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871886864] [2023-04-02 01:12:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:12:20,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:12:20,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:12:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:12:20,114 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:20,280 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-04-02 01:12:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 01:12:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-04-02 01:12:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:20,282 INFO L225 Difference]: With dead ends: 46 [2023-04-02 01:12:20,282 INFO L226 Difference]: Without dead ends: 31 [2023-04-02 01:12:20,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:12:20,289 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:20,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 9 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:12:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-02 01:12:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-04-02 01:12:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-04-02 01:12:20,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2023-04-02 01:12:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:20,300 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-04-02 01:12:20,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-04-02 01:12:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 01:12:20,302 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:20,302 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] [2023-04-02 01:12:20,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 01:12:20,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:20,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1562283532, now seen corresponding path program 1 times [2023-04-02 01:12:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:20,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170619414] [2023-04-02 01:12:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:20,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:20,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:20,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170619414] [2023-04-02 01:12:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170619414] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577916632] [2023-04-02 01:12:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:20,534 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:12:20,535 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:12:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:20,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:12:20,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:20,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577916632] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:12:20,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:12:20,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-04-02 01:12:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700482756] [2023-04-02 01:12:20,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:12:20,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 01:12:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 01:12:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:12:20,869 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:12:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:21,095 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-04-02 01:12:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 01:12:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2023-04-02 01:12:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:21,097 INFO L225 Difference]: With dead ends: 49 [2023-04-02 01:12:21,097 INFO L226 Difference]: Without dead ends: 34 [2023-04-02 01:12:21,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-04-02 01:12:21,100 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:21,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 11 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:12:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-02 01:12:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-04-02 01:12:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-04-02 01:12:21,114 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2023-04-02 01:12:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:21,114 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-04-02 01:12:21,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:12:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-04-02 01:12:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 01:12:21,116 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:21,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:21,131 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:12:21,322 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:12:21,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:21,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 369837472, now seen corresponding path program 2 times [2023-04-02 01:12:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:21,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475623483] [2023-04-02 01:12:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475623483] [2023-04-02 01:12:21,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475623483] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792419186] [2023-04-02 01:12:21,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:12:21,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:21,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:21,517 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:12:21,519 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:12:21,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:12:21,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:12:21,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 01:12:21,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:21,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792419186] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:12:21,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:12:21,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2023-04-02 01:12:21,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696247575] [2023-04-02 01:12:21,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:12:21,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 01:12:21,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 01:12:21,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:12:21,843 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:12:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:22,016 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-04-02 01:12:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 01:12:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2023-04-02 01:12:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:22,018 INFO L225 Difference]: With dead ends: 52 [2023-04-02 01:12:22,019 INFO L226 Difference]: Without dead ends: 37 [2023-04-02 01:12:22,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-04-02 01:12:22,021 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:22,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 11 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:12:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-02 01:12:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-04-02 01:12:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-04-02 01:12:22,032 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2023-04-02 01:12:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:22,032 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-04-02 01:12:22,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:12:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-04-02 01:12:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-02 01:12:22,033 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:22,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:22,043 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:12:22,239 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:12:22,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:22,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash -965033356, now seen corresponding path program 3 times [2023-04-02 01:12:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:22,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811727717] [2023-04-02 01:12:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811727717] [2023-04-02 01:12:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811727717] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:22,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947572564] [2023-04-02 01:12:22,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:12:22,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:22,436 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:12:22,439 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:12:22,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 01:12:22,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:12:22,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 39 conjunts are in the unsatisfiable core [2023-04-02 01:12:22,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:22,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:12:22,718 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 19 treesize of output 18 [2023-04-02 01:12:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 01:12:22,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 01:12:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947572564] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:12:23,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:12:23,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2023-04-02 01:12:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437101920] [2023-04-02 01:12:23,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:12:23,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-02 01:12:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-02 01:12:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2023-04-02 01:12:23,081 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:12:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:23,613 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-04-02 01:12:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 01:12:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-04-02 01:12:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:23,614 INFO L225 Difference]: With dead ends: 57 [2023-04-02 01:12:23,614 INFO L226 Difference]: Without dead ends: 42 [2023-04-02 01:12:23,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=1401, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 01:12:23,615 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 141 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:23,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 29 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:12:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-04-02 01:12:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-04-02 01:12:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-04-02 01:12:23,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 27 [2023-04-02 01:12:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:23,626 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-04-02 01:12:23,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:12:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-04-02 01:12:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 01:12:23,627 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:23,627 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:23,639 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:12:23,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:23,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:23,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -62606274, now seen corresponding path program 1 times [2023-04-02 01:12:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:23,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271856183] [2023-04-02 01:12:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 01:12:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271856183] [2023-04-02 01:12:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271856183] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672238620] [2023-04-02 01:12:25,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:25,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:25,527 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:12:25,529 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:12:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:25,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 73 conjunts are in the unsatisfiable core [2023-04-02 01:12:25,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:25,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:12:25,806 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 14 treesize of output 15 [2023-04-02 01:12:25,816 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-04-02 01:12:25,816 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 18 treesize of output 28 [2023-04-02 01:12:25,824 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 5 treesize of output 3 [2023-04-02 01:12:25,830 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 14 treesize of output 15 [2023-04-02 01:12:25,890 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:12:25,891 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 31 treesize of output 30 [2023-04-02 01:12:25,896 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 23 treesize of output 22 [2023-04-02 01:12:25,908 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-04-02 01:12:25,909 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 19 treesize of output 18 [2023-04-02 01:12:26,182 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-04-02 01:12:26,183 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 41 treesize of output 51 [2023-04-02 01:12:26,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:26,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2023-04-02 01:12:26,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:26,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2023-04-02 01:12:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 01:12:26,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:26,691 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:26,692 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2023-04-02 01:12:26,753 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (= (select (select (store (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681)) c_sll_circular_create_~head~0.base v_ArrVal_689) (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)) (+ .cse0 4)) |c_sll_circular_create_#in~data|) (= .cse0 c_sll_circular_create_~head~0.offset)))) (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (= (select (select (store (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681)) c_sll_circular_create_~head~0.base v_ArrVal_689) .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset) 4)) |c_sll_circular_create_#in~data|) (= c_sll_circular_create_~head~0.base .cse1))))) is different from false [2023-04-02 01:12:27,030 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (= c_sll_circular_create_~new_head~0.offset c_sll_circular_create_~last~0.offset)) (.cse1 (+ c_sll_circular_create_~head~0.offset 4)) (.cse2 (+ c_sll_circular_create_~new_head~0.offset 4))) (and (or (= c_sll_circular_create_~head~0.offset c_sll_circular_create_~new_head~0.offset) (and (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse3 sll_circular_create_~last~0.base (store (select .cse3 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse0 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse0 .cse2) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_689 .cse2) |c_sll_circular_create_#in~data|)))))) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (= (select (select (store (let ((.cse4 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse4 sll_circular_create_~last~0.base (store (select .cse4 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)))) (or (and (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse6 sll_circular_create_~last~0.base (store (select .cse6 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse5 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse5 .cse2) |c_sll_circular_create_#in~data|)))) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse7 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse7 sll_circular_create_~last~0.base (store (select .cse7 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse9 sll_circular_create_~last~0.base (store (select .cse9 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse8 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse8 .cse2) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_689 .cse2) |c_sll_circular_create_#in~data|))))) .cse10) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse12 sll_circular_create_~last~0.base (store (select .cse12 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse11 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse11 .cse2) |c_sll_circular_create_#in~data|)))))))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (= (select (select (store (let ((.cse13 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse13 sll_circular_create_~last~0.base (store (select .cse13 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (or (and (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse14 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse14 sll_circular_create_~last~0.base (store (select .cse14 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse16 sll_circular_create_~last~0.base (store (select .cse16 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse15 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse15 .cse2) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse18 sll_circular_create_~last~0.base (store (select .cse18 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse17 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse17 .cse2) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_689 .cse2) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base)))) .cse10) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse20 sll_circular_create_~last~0.base (store (select .cse20 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse19 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse19 .cse2) |c_sll_circular_create_#in~data|)))))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse22 sll_circular_create_~last~0.base (store (select .cse22 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse21 .cse1) |c_sll_circular_create_#in~data|) (= (select .cse21 .cse2) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_689 .cse2) |c_sll_circular_create_#in~data|)))))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))))) is different from false [2023-04-02 01:12:27,354 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_sll_circular_create_~last~0.offset 0)) (.cse1 (+ c_sll_circular_create_~head~0.offset 4))) (and (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse0 sll_circular_create_~last~0.base (store (select .cse0 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (or (= c_sll_circular_create_~head~0.offset 0) (and (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse2 (select (store (let ((.cse3 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse3 sll_circular_create_~last~0.base (store (select .cse3 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse2 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select .cse2 4))))))) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (= (select (select (store (let ((.cse4 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse4 sll_circular_create_~last~0.base (store (select .cse4 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)))) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse6 sll_circular_create_~last~0.base (store (select .cse6 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse5 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select v_ArrVal_689 4)) (= |c_sll_circular_create_#in~data| (select .cse5 4))))) (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base))) (or .cse7 (and (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse8 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse8 sll_circular_create_~last~0.base (store (select .cse8 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse10 sll_circular_create_~last~0.base (store (select .cse10 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse9 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select .cse9 4))))) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse12 sll_circular_create_~last~0.base (store (select .cse12 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse11 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select v_ArrVal_689 4)) (= |c_sll_circular_create_#in~data| (select .cse11 4))))))))) (or .cse7 (and (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse13 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse13 sll_circular_create_~last~0.base (store (select .cse13 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse15 sll_circular_create_~last~0.base (store (select .cse15 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse14 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select v_ArrVal_689 4)) (= |c_sll_circular_create_#in~data| (select .cse14 4))))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse17 sll_circular_create_~last~0.base (store (select .cse17 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse16 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select .cse16 4))))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base) (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse19 sll_circular_create_~last~0.base (store (select .cse19 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse18 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select .cse18 4))))))))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_681 Int)) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_678))) (store .cse21 sll_circular_create_~last~0.base (store (select .cse21 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_681))) sll_circular_create_~new_head~0.base v_ArrVal_689) c_sll_circular_create_~head~0.base))) (or (= (select .cse20 .cse1) |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~data| (select v_ArrVal_689 4)) (= |c_sll_circular_create_#in~data| (select .cse20 4))))) (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))))) is different from false [2023-04-02 01:12:27,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:27,418 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-04-02 01:12:27,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:27,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2023-04-02 01:12:27,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:27,467 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 83 treesize of output 73 [2023-04-02 01:12:27,490 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 5 treesize of output 3 [2023-04-02 01:12:27,495 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 01:12:27,495 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-04-02 01:12:27,501 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 01:12:27,501 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-04-02 01:12:27,506 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 01:12:27,506 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-04-02 01:12:27,511 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 01:12:27,511 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-04-02 01:12:27,517 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 01:12:27,517 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-04-02 01:12:27,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:27,526 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-04-02 01:12:27,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:27,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5461 treesize of output 5355 [2023-04-02 01:12:27,608 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2023-04-02 01:12:27,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 112 [2023-04-02 01:12:27,664 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 8 treesize of output 4 [2023-04-02 01:12:27,666 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-04-02 01:12:27,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:27,674 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-04-02 01:12:27,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,683 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-02 01:12:27,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 537 treesize of output 514 [2023-04-02 01:12:27,692 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-04-02 01:12:27,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:27,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-04-02 01:12:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2023-04-02 01:12:27,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672238620] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:12:27,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:12:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13] total 39 [2023-04-02 01:12:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119449953] [2023-04-02 01:12:27,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:12:27,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-04-02 01:12:27,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-04-02 01:12:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1151, Unknown=3, NotChecked=210, Total=1482 [2023-04-02 01:12:27,776 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 34 states have internal predecessors, (68), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 01:12:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:29,405 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2023-04-02 01:12:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 01:12:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 34 states have internal predecessors, (68), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-04-02 01:12:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:29,407 INFO L225 Difference]: With dead ends: 59 [2023-04-02 01:12:29,407 INFO L226 Difference]: Without dead ends: 57 [2023-04-02 01:12:29,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=302, Invalid=2359, Unknown=3, NotChecked=306, Total=2970 [2023-04-02 01:12:29,408 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 145 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:29,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 55 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 831 Invalid, 0 Unknown, 164 Unchecked, 0.5s Time] [2023-04-02 01:12:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-02 01:12:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2023-04-02 01:12:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-04-02 01:12:29,413 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 33 [2023-04-02 01:12:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:29,414 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-04-02 01:12:29,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 34 states have internal predecessors, (68), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 01:12:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-04-02 01:12:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-02 01:12:29,414 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:29,415 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:12:29,425 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:12:29,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:29,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:29,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1942179851, now seen corresponding path program 1 times [2023-04-02 01:12:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244381997] [2023-04-02 01:12:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:29,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 01:12:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244381997] [2023-04-02 01:12:30,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244381997] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019650585] [2023-04-02 01:12:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:30,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:30,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:30,133 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:12:30,135 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:12:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:30,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-02 01:12:30,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:30,300 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:12:30,323 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:12:30,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:12:30,341 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:12:30,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:12:30,354 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:12:30,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-04-02 01:12:30,412 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-04-02 01:12:30,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-04-02 01:12:30,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-02 01:12:30,437 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 15 treesize of output 17 [2023-04-02 01:12:30,470 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 16 treesize of output 8 [2023-04-02 01:12:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 01:12:30,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:30,613 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (not (= c_sll_circular_create_~head~0.base (select (select (store |c_#memory_$Pointer$.base| c_sll_circular_create_~last~0.base v_ArrVal_933) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)))) is different from false [2023-04-02 01:12:30,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:30,622 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-04-02 01:12:30,624 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 33 treesize of output 25 [2023-04-02 01:12:30,626 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 6 treesize of output 4 [2023-04-02 01:12:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2023-04-02 01:12:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019650585] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:12:30,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:12:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 24 [2023-04-02 01:12:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105114392] [2023-04-02 01:12:30,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:12:30,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-02 01:12:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-02 01:12:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2023-04-02 01:12:30,734 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 20 states have internal predecessors, (54), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 01:12:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:31,105 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2023-04-02 01:12:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 01:12:31,106 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 20 states have internal predecessors, (54), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2023-04-02 01:12:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:31,106 INFO L225 Difference]: With dead ends: 51 [2023-04-02 01:12:31,106 INFO L226 Difference]: Without dead ends: 43 [2023-04-02 01:12:31,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=894, Unknown=1, NotChecked=62, Total=1122 [2023-04-02 01:12:31,107 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 65 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:31,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 409 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2023-04-02 01:12:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-04-02 01:12:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-04-02 01:12:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:12:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-04-02 01:12:31,112 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 34 [2023-04-02 01:12:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:31,112 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-04-02 01:12:31,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 20 states have internal predecessors, (54), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 01:12:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-04-02 01:12:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 01:12:31,113 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:31,113 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:31,131 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:12:31,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:31,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:31,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1086756768, now seen corresponding path program 2 times [2023-04-02 01:12:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:31,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145335521] [2023-04-02 01:12:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:12:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:12:33,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:33,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145335521] [2023-04-02 01:12:33,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145335521] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:33,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038116407] [2023-04-02 01:12:33,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:12:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:33,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:33,213 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:12:33,228 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:12:33,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:12:33,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:12:33,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 111 conjunts are in the unsatisfiable core [2023-04-02 01:12:33,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:33,406 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:12:33,428 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:12:33,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:12:33,454 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:12:33,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:12:33,505 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:12:33,554 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-04-02 01:12:33,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-04-02 01:12:33,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-02 01:12:33,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-02 01:12:33,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-04-02 01:12:33,753 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:12:33,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-04-02 01:12:33,764 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-04-02 01:12:33,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2023-04-02 01:12:33,779 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:12:33,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-04-02 01:12:33,789 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 5 treesize of output 3 [2023-04-02 01:12:33,942 INFO L321 Elim1Store]: treesize reduction 64, result has 26.4 percent of original size [2023-04-02 01:12:33,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 112 [2023-04-02 01:12:33,961 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-04-02 01:12:33,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 86 [2023-04-02 01:12:33,974 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-04-02 01:12:33,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-04-02 01:12:34,803 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-04-02 01:12:34,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 174 [2023-04-02 01:12:34,822 INFO L321 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2023-04-02 01:12:34,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 246 [2023-04-02 01:12:34,875 INFO L321 Elim1Store]: treesize reduction 54, result has 64.9 percent of original size [2023-04-02 01:12:34,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 300 [2023-04-02 01:12:39,517 INFO L321 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-04-02 01:12:39,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 113 [2023-04-02 01:12:39,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:39,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 88 [2023-04-02 01:12:39,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:12:39,562 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 1 case distinctions, treesize of input 48 treesize of output 50 [2023-04-02 01:12:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:12:39,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:40,860 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:40,861 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2125 treesize of output 1 [2023-04-02 01:12:41,019 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$.base| c_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base))) (.cse2 (store |c_#memory_$Pointer$.offset| c_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)))) (let ((.cse3 (select .cse2 c_sll_circular_create_~head~0.base)) (.cse7 (select .cse6 c_sll_circular_create_~head~0.base))) (let ((.cse4 (+ c_sll_circular_create_~head~0.offset 4)) (.cse1 (select .cse7 c_sll_circular_create_~head~0.offset)) (.cse5 (select .cse3 c_sll_circular_create_~head~0.offset))) (and (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1205 Int) (v_ArrVal_1209 (Array Int Int))) (let ((.cse0 (select (select (store .cse6 c_sll_circular_create_~head~0.base (store .cse7 .cse4 v_ArrVal_1202)) .cse1) .cse5))) (or (= c_sll_circular_create_~head~0.base .cse0) (= (select (select (store (store (store |c_#memory_int| c_sll_circular_create_~last~0.base v_ArrVal_1200) c_sll_circular_create_~head~0.base v_ArrVal_1204) .cse1 v_ArrVal_1209) .cse0) (+ (select (select (store .cse2 c_sll_circular_create_~head~0.base (store .cse3 .cse4 v_ArrVal_1205)) .cse1) .cse5) 4)) |c_sll_circular_create_#in~data|)))) (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1205 Int) (v_ArrVal_1209 (Array Int Int))) (let ((.cse8 (select (select (store .cse2 c_sll_circular_create_~head~0.base (store .cse3 .cse4 v_ArrVal_1205)) .cse1) .cse5))) (or (= c_sll_circular_create_~head~0.offset .cse8) (= (select (select (store (store (store |c_#memory_int| c_sll_circular_create_~last~0.base v_ArrVal_1200) c_sll_circular_create_~head~0.base v_ArrVal_1204) .cse1 v_ArrVal_1209) (select (select (store .cse6 c_sll_circular_create_~head~0.base (store .cse7 .cse4 v_ArrVal_1202)) .cse1) .cse5)) (+ .cse8 4)) |c_sll_circular_create_#in~data|)))))))) is different from false [2023-04-02 01:12:50,176 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1193 Int) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1189 Int) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1205 Int) (v_ArrVal_1209 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.base) 4 v_ArrVal_1193)))) (store .cse8 c_sll_circular_create_~last~0.base (store (select .cse8 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset sll_circular_create_~new_head~0.base)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.offset) 4 v_ArrVal_1189)))) (store .cse7 c_sll_circular_create_~last~0.base (store (select .cse7 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset 0))))) (let ((.cse3 (select .cse2 sll_circular_create_~new_head~0.base)) (.cse6 (select .cse5 sll_circular_create_~new_head~0.base))) (let ((.cse1 (select .cse6 0)) (.cse4 (select .cse3 0))) (let ((.cse0 (select (select (store .cse5 sll_circular_create_~new_head~0.base (store .cse6 4 v_ArrVal_1202)) .cse1) .cse4))) (or (= .cse0 sll_circular_create_~new_head~0.base) (= (select (select (store (store (store (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_1192) c_sll_circular_create_~last~0.base v_ArrVal_1200) sll_circular_create_~new_head~0.base v_ArrVal_1204) .cse1 v_ArrVal_1209) .cse0) (+ (select (select (store .cse2 sll_circular_create_~new_head~0.base (store .cse3 4 v_ArrVal_1205)) .cse1) .cse4) 4)) |c_sll_circular_create_#in~data|))))))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1193 Int) (sll_circular_create_~new_head~0.base Int) (v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1189 Int) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1205 Int) (v_ArrVal_1209 (Array Int Int))) (let ((.cse11 (let ((.cse17 (store |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.base) 4 v_ArrVal_1193)))) (store .cse17 c_sll_circular_create_~last~0.base (store (select .cse17 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset sll_circular_create_~new_head~0.base)))) (.cse14 (let ((.cse16 (store |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.offset) 4 v_ArrVal_1189)))) (store .cse16 c_sll_circular_create_~last~0.base (store (select .cse16 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset 0))))) (let ((.cse15 (select .cse14 sll_circular_create_~new_head~0.base)) (.cse12 (select .cse11 sll_circular_create_~new_head~0.base))) (let ((.cse10 (select .cse12 0)) (.cse13 (select .cse15 0))) (let ((.cse9 (select (select (store .cse14 sll_circular_create_~new_head~0.base (store .cse15 4 v_ArrVal_1205)) .cse10) .cse13))) (or (= .cse9 0) (= (select (select (store (store (store (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_1192) c_sll_circular_create_~last~0.base v_ArrVal_1200) sll_circular_create_~new_head~0.base v_ArrVal_1204) .cse10 v_ArrVal_1209) (select (select (store .cse11 sll_circular_create_~new_head~0.base (store .cse12 4 v_ArrVal_1202)) .cse10) .cse13)) (+ .cse9 4)) |c_sll_circular_create_#in~data|)))))))) is different from false [2023-04-02 01:12:50,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:50,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7822011 treesize of output 7775939 [2023-04-02 01:13:50,582 WARN L223 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 1024 DAG size of output: 830 (called from [L 809] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-04-02 01:13:51,270 INFO L321 Elim1Store]: treesize reduction 306, result has 32.0 percent of original size [2023-04-02 01:13:51,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 18318718 treesize of output 18204951 [2023-04-02 01:14:37,831 WARN L223 SmtUtils]: Spent 46.55s on a formula simplification. DAG size of input: 4298 DAG size of output: 868 (called from [L 809] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-04-02 01:14:39,630 INFO L321 Elim1Store]: treesize reduction 48, result has 55.1 percent of original size [2023-04-02 01:14:39,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 136 treesize of output 164 [2023-04-02 01:15:13,290 WARN L223 SmtUtils]: Spent 22.87s on a formula simplification. DAG size of input: 649 DAG size of output: 880 (called from [L 809] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)