./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:54:27,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:54:27,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:54:27,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:54:27,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:54:27,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:54:27,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:54:27,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:54:27,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:54:27,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:54:27,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:54:27,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:54:27,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:54:27,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:54:27,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:54:27,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:54:27,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:54:27,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:54:27,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:54:28,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:54:28,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:54:28,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:54:28,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:54:28,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:54:28,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:54:28,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:54:28,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:54:28,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:54:28,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:54:28,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:54:28,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:54:28,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:54:28,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:54:28,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:54:28,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:54:28,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:54:28,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:54:28,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:54:28,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:54:28,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:54:28,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:54:28,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:54:28,037 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:54:28,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:54:28,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:54:28,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:54:28,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:54:28,038 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:54:28,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:54:28,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:54:28,039 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:54:28,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:54:28,040 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:54:28,040 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:54:28,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:54:28,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:54:28,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:54:28,041 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:54:28,041 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:54:28,041 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:54:28,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:54:28,041 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:54:28,041 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:54:28,041 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:54:28,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:54:28,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:54:28,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:54:28,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:54:28,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:54:28,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:54:28,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:54:28,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:54:28,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:54:28,043 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:54:28,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:54:28,043 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:54:28,044 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-02-14 13:54:28,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:54:28,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:54:28,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:54:28,267 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:54:28,267 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:54:28,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-02-14 13:54:29,243 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:54:29,439 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:54:29,440 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-02-14 13:54:29,451 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ff1ea205/0fb0e9cddbf248c2a8ce2424e73170b3/FLAG830e0e246 [2023-02-14 13:54:29,460 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ff1ea205/0fb0e9cddbf248c2a8ce2424e73170b3 [2023-02-14 13:54:29,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:54:29,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:54:29,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:54:29,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:54:29,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:54:29,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8ad118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29, skipping insertion in model container [2023-02-14 13:54:29,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:54:29,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:54:29,639 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-02-14 13:54:29,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:54:29,646 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:54:29,720 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-02-14 13:54:29,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:54:29,758 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:54:29,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29 WrapperNode [2023-02-14 13:54:29,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:54:29,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:54:29,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:54:29,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:54:29,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,785 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2023-02-14 13:54:29,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:54:29,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:54:29,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:54:29,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:54:29,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,808 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:54:29,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:54:29,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:54:29,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:54:29,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (1/1) ... [2023-02-14 13:54:29,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:54:29,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:29,835 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-02-14 13:54:29,838 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-02-14 13:54:29,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:54:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:54:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 13:54:29,859 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 13:54:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:54:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:54:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:54:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:54:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:54:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:54:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:54:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:54:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:54:29,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:54:30,002 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:54:30,004 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:54:30,274 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:54:30,279 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:54:30,279 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 13:54:30,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:54:30 BoogieIcfgContainer [2023-02-14 13:54:30,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:54:30,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:54:30,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:54:30,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:54:30,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:54:29" (1/3) ... [2023-02-14 13:54:30,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42da037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:54:30, skipping insertion in model container [2023-02-14 13:54:30,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:29" (2/3) ... [2023-02-14 13:54:30,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42da037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:54:30, skipping insertion in model container [2023-02-14 13:54:30,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:54:30" (3/3) ... [2023-02-14 13:54:30,286 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-02-14 13:54:30,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:54:30,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-02-14 13:54:30,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:54:30,329 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@28feaf7c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:54:30,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-02-14 13:54:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:54:30,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:30,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:54:30,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2023-02-14 13:54:30,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:30,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382817629] [2023-02-14 13:54:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:30,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:30,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382817629] [2023-02-14 13:54:30,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382817629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:30,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:30,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:54:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804191216] [2023-02-14 13:54:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:30,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:30,583 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:30,672 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2023-02-14 13:54:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:54:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:30,679 INFO L225 Difference]: With dead ends: 114 [2023-02-14 13:54:30,679 INFO L226 Difference]: Without dead ends: 111 [2023-02-14 13:54:30,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:30,683 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:30,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-14 13:54:30,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-14 13:54:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-14 13:54:30,712 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2023-02-14 13:54:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:30,713 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-14 13:54:30,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-14 13:54:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:54:30,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:30,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:54:30,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:54:30,715 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2023-02-14 13:54:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181509436] [2023-02-14 13:54:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:30,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:30,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181509436] [2023-02-14 13:54:30,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181509436] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:30,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:30,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:54:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097867134] [2023-02-14 13:54:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:30,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:30,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:30,806 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:30,859 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2023-02-14 13:54:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:54:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:30,861 INFO L225 Difference]: With dead ends: 109 [2023-02-14 13:54:30,861 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 13:54:30,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:30,862 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:30,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 13:54:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-14 13:54:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2023-02-14 13:54:30,869 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2023-02-14 13:54:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:30,869 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2023-02-14 13:54:30,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2023-02-14 13:54:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:54:30,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:30,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:30,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:54:30,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2023-02-14 13:54:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:30,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789153591] [2023-02-14 13:54:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:30,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:30,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:30,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789153591] [2023-02-14 13:54:30,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789153591] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:30,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:30,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:54:30,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349028711] [2023-02-14 13:54:30,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:30,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:54:30,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:30,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:54:30,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:54:30,940 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:54:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:31,013 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-02-14 13:54:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:54:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-14 13:54:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:31,015 INFO L225 Difference]: With dead ends: 116 [2023-02-14 13:54:31,015 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 13:54:31,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:54:31,016 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:31,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 13:54:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-02-14 13:54:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2023-02-14 13:54:31,023 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2023-02-14 13:54:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:31,023 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2023-02-14 13:54:31,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:54:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2023-02-14 13:54:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:54:31,024 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:31,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:31,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:54:31,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2023-02-14 13:54:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:31,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142389467] [2023-02-14 13:54:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:31,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:31,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142389467] [2023-02-14 13:54:31,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142389467] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:31,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:31,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:54:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365977634] [2023-02-14 13:54:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:31,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:54:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:54:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:54:31,130 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:54:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:31,301 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2023-02-14 13:54:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:54:31,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 13:54:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:31,305 INFO L225 Difference]: With dead ends: 110 [2023-02-14 13:54:31,305 INFO L226 Difference]: Without dead ends: 110 [2023-02-14 13:54:31,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:54:31,311 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:31,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:54:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-14 13:54:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2023-02-14 13:54:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2023-02-14 13:54:31,326 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2023-02-14 13:54:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:31,327 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2023-02-14 13:54:31,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:54:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2023-02-14 13:54:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:54:31,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:31,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:31,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:54:31,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2023-02-14 13:54:31,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:31,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253279514] [2023-02-14 13:54:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:31,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253279514] [2023-02-14 13:54:31,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253279514] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:31,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:31,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:54:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953649846] [2023-02-14 13:54:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:31,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:54:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:54:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:54:31,567 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:54:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:31,744 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2023-02-14 13:54:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:54:31,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 13:54:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:31,746 INFO L225 Difference]: With dead ends: 109 [2023-02-14 13:54:31,749 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 13:54:31,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:54:31,751 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:31,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:54:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 13:54:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2023-02-14 13:54:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-14 13:54:31,761 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2023-02-14 13:54:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:31,761 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-14 13:54:31,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:54:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-14 13:54:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:54:31,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:31,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:54:31,763 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2023-02-14 13:54:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:31,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644948895] [2023-02-14 13:54:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:54:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:32,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644948895] [2023-02-14 13:54:32,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644948895] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:32,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830628263] [2023-02-14 13:54:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:32,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:32,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:32,022 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-02-14 13:54:32,026 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-02-14 13:54:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:32,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 13:54:32,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:32,175 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-02-14 13:54:32,212 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-14 13:54:32,223 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-14 13:54:32,241 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:54:32,242 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 18 [2023-02-14 13:54:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-14 13:54:32,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:32,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830628263] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:54:32,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:54:32,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-14 13:54:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52206766] [2023-02-14 13:54:32,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:32,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 13:54:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 13:54:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-14 13:54:32,533 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:54:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:32,759 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2023-02-14 13:54:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:54:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-14 13:54:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:32,761 INFO L225 Difference]: With dead ends: 125 [2023-02-14 13:54:32,761 INFO L226 Difference]: Without dead ends: 125 [2023-02-14 13:54:32,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-14 13:54:32,762 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 94 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:32,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 406 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 260 Unchecked, 0.2s Time] [2023-02-14 13:54:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-14 13:54:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-02-14 13:54:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 102 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2023-02-14 13:54:32,769 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 25 [2023-02-14 13:54:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:32,770 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2023-02-14 13:54:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:54:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2023-02-14 13:54:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:54:32,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:32,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:32,777 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-02-14 13:54:32,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-14 13:54:32,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:32,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2023-02-14 13:54:32,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:32,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873240258] [2023-02-14 13:54:32,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:32,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:33,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873240258] [2023-02-14 13:54:33,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873240258] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:33,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48709127] [2023-02-14 13:54:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:33,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:33,309 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-02-14 13:54:33,328 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-02-14 13:54:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:33,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 13:54:33,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:33,409 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-02-14 13:54:33,571 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:54:33,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:54:33,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2023-02-14 13:54:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:33,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:33,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48709127] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:33,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:54:33,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-14 13:54:33,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112865059] [2023-02-14 13:54:33,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:33,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:54:33,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:33,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:54:33,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-02-14 13:54:33,732 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:54:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:34,067 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-02-14 13:54:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:54:34,067 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-14 13:54:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:34,068 INFO L225 Difference]: With dead ends: 108 [2023-02-14 13:54:34,068 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 13:54:34,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-14 13:54:34,069 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:34,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 453 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 13:54:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 13:54:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-02-14 13:54:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8) internal successors, (108), 101 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2023-02-14 13:54:34,071 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 25 [2023-02-14 13:54:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:34,071 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2023-02-14 13:54:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:54:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2023-02-14 13:54:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 13:54:34,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:34,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:34,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-14 13:54:34,276 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,SelfDestructingSolverStorable6 [2023-02-14 13:54:34,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2023-02-14 13:54:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:34,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939252439] [2023-02-14 13:54:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:34,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939252439] [2023-02-14 13:54:34,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939252439] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268108476] [2023-02-14 13:54:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:34,560 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-02-14 13:54:34,566 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-02-14 13:54:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:34,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 13:54:34,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:34,670 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-02-14 13:54:34,677 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-02-14 13:54:34,691 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:54:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:34,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:54:34,729 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2023-02-14 13:54:34,737 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2023-02-14 13:54:34,748 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:54:34,749 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 18 [2023-02-14 13:54:34,784 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-14 13:54:34,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:54:34,803 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-02-14 13:54:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 13:54:34,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:35,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268108476] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:35,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:54:35,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2023-02-14 13:54:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929718056] [2023-02-14 13:54:35,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:35,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 13:54:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 13:54:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2023-02-14 13:54:35,056 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:54:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:35,275 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-02-14 13:54:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:54:35,276 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-14 13:54:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:35,276 INFO L225 Difference]: With dead ends: 116 [2023-02-14 13:54:35,276 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 13:54:35,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=363, Unknown=4, NotChecked=172, Total=650 [2023-02-14 13:54:35,277 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 324 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:35,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 229 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 402 Unchecked, 0.2s Time] [2023-02-14 13:54:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 13:54:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2023-02-14 13:54:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-02-14 13:54:35,279 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2023-02-14 13:54:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:35,279 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-02-14 13:54:35,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:54:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-02-14 13:54:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 13:54:35,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:35,280 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:35,290 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-02-14 13:54:35,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:35,480 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2023-02-14 13:54:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:35,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835915619] [2023-02-14 13:54:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:35,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:35,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:54:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835915619] [2023-02-14 13:54:35,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835915619] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3709275] [2023-02-14 13:54:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:35,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:35,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:35,874 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-02-14 13:54:35,876 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-02-14 13:54:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:35,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:54:35,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:35,992 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-02-14 13:54:36,001 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-02-14 13:54:36,017 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2023-02-14 13:54:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:36,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:54:36,057 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-02-14 13:54:36,063 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:54:36,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:36,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:54:36,143 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-02-14 13:54:36,150 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:54:36,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:36,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:54:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 13:54:36,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:38,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3709275] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:38,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:54:38,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-02-14 13:54:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020692843] [2023-02-14 13:54:38,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:38,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 13:54:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:38,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 13:54:38,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2023-02-14 13:54:38,252 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:54:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:38,485 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-02-14 13:54:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:54:38,485 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-14 13:54:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:38,486 INFO L225 Difference]: With dead ends: 108 [2023-02-14 13:54:38,486 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 13:54:38,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2023-02-14 13:54:38,486 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 279 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:38,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 203 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 273 Unchecked, 0.2s Time] [2023-02-14 13:54:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 13:54:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-14 13:54:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-14 13:54:38,488 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2023-02-14 13:54:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:38,489 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-14 13:54:38,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:54:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-14 13:54:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 13:54:38,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:38,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:38,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-14 13:54:38,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:38,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2023-02-14 13:54:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:38,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262751356] [2023-02-14 13:54:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:38,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:38,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 13:54:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262751356] [2023-02-14 13:54:38,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262751356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:38,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:38,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:54:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231109802] [2023-02-14 13:54:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:54:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:54:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:54:38,772 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:54:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:38,895 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-02-14 13:54:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:54:38,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-14 13:54:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:38,896 INFO L225 Difference]: With dead ends: 106 [2023-02-14 13:54:38,896 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 13:54:38,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:54:38,897 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:38,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 13:54:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2023-02-14 13:54:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-14 13:54:38,899 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 39 [2023-02-14 13:54:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:38,899 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-14 13:54:38,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:54:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-14 13:54:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 13:54:38,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:38,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:38,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:54:38,900 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2023-02-14 13:54:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649361342] [2023-02-14 13:54:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:54:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649361342] [2023-02-14 13:54:39,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649361342] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:39,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:39,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:54:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750418370] [2023-02-14 13:54:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:39,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:54:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:54:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:54:39,049 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:54:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:39,160 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-14 13:54:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:54:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-14 13:54:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:39,161 INFO L225 Difference]: With dead ends: 86 [2023-02-14 13:54:39,161 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 13:54:39,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:54:39,161 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:39,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 13:54:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-14 13:54:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-14 13:54:39,163 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 39 [2023-02-14 13:54:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:39,163 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-14 13:54:39,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:54:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-14 13:54:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:54:39,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:39,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:39,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 13:54:39,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2023-02-14 13:54:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:39,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071461003] [2023-02-14 13:54:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:39,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:54:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:39,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071461003] [2023-02-14 13:54:39,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071461003] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:39,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421306608] [2023-02-14 13:54:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:39,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:39,611 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-02-14 13:54:39,612 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-02-14 13:54:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:39,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-14 13:54:39,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:39,872 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 9 treesize of output 5 [2023-02-14 13:54:39,950 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1044 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1044))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-14 13:54:39,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:39,968 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 16 treesize of output 18 [2023-02-14 13:54:39,976 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-14 13:54:39,977 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 16 treesize of output 18 [2023-02-14 13:54:40,029 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 17 treesize of output 9 [2023-02-14 13:54:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:54:40,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:54:40,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421306608] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:40,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:54:40,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-14 13:54:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091707842] [2023-02-14 13:54:40,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:40,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 13:54:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:40,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 13:54:40,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-14 13:54:40,045 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:54:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:40,423 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-02-14 13:54:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 13:54:40,423 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-14 13:54:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:40,424 INFO L225 Difference]: With dead ends: 128 [2023-02-14 13:54:40,424 INFO L226 Difference]: Without dead ends: 128 [2023-02-14 13:54:40,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-14 13:54:40,425 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:40,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 665 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 580 Invalid, 3 Unknown, 178 Unchecked, 0.3s Time] [2023-02-14 13:54:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-14 13:54:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2023-02-14 13:54:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-02-14 13:54:40,427 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 41 [2023-02-14 13:54:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:40,427 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-02-14 13:54:40,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:54:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-02-14 13:54:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:54:40,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:40,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:40,436 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-02-14 13:54:40,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-14 13:54:40,628 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2023-02-14 13:54:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:40,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653835702] [2023-02-14 13:54:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:41,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:41,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653835702] [2023-02-14 13:54:41,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653835702] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:41,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761079291] [2023-02-14 13:54:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:41,317 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-02-14 13:54:41,317 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-02-14 13:54:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:41,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-14 13:54:41,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:41,773 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 19 treesize of output 11 [2023-02-14 13:54:41,776 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 7 treesize of output 3 [2023-02-14 13:54:41,889 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1203 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1203))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1199 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1199) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1202 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1202))))) is different from true [2023-02-14 13:54:41,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:41,922 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 25 treesize of output 25 [2023-02-14 13:54:41,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:41,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2023-02-14 13:54:41,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:41,931 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 14 treesize of output 16 [2023-02-14 13:54:41,938 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:54:41,938 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 15 treesize of output 15 [2023-02-14 13:54:41,986 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 17 treesize of output 9 [2023-02-14 13:54:41,987 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 15 treesize of output 7 [2023-02-14 13:54:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:54:42,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:42,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761079291] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:42,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:54:42,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2023-02-14 13:54:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522318865] [2023-02-14 13:54:42,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:42,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 13:54:42,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:42,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 13:54:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2023-02-14 13:54:42,791 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:54:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:44,332 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2023-02-14 13:54:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 13:54:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-14 13:54:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:44,333 INFO L225 Difference]: With dead ends: 140 [2023-02-14 13:54:44,333 INFO L226 Difference]: Without dead ends: 140 [2023-02-14 13:54:44,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=331, Invalid=2638, Unknown=5, NotChecked=106, Total=3080 [2023-02-14 13:54:44,334 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 436 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:44,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1257 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1304 Invalid, 3 Unknown, 150 Unchecked, 0.8s Time] [2023-02-14 13:54:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-14 13:54:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 89. [2023-02-14 13:54:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2023-02-14 13:54:44,336 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2023-02-14 13:54:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:44,337 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2023-02-14 13:54:44,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:54:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2023-02-14 13:54:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:54:44,337 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:44,337 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:44,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:44,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:44,544 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2023-02-14 13:54:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:44,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774769471] [2023-02-14 13:54:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 13:54:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774769471] [2023-02-14 13:54:44,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774769471] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:44,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:44,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:54:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773283187] [2023-02-14 13:54:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:54:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:44,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:54:44,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:54:44,718 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:54:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:44,911 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-02-14 13:54:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 13:54:44,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2023-02-14 13:54:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:44,912 INFO L225 Difference]: With dead ends: 152 [2023-02-14 13:54:44,912 INFO L226 Difference]: Without dead ends: 152 [2023-02-14 13:54:44,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:54:44,912 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 270 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:44,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 398 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-14 13:54:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2023-02-14 13:54:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.391304347826087) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-02-14 13:54:44,914 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2023-02-14 13:54:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:44,914 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-02-14 13:54:44,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:54:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-02-14 13:54:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:54:44,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:44,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:44,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 13:54:44,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:44,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2023-02-14 13:54:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:44,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127339837] [2023-02-14 13:54:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:54:45,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:45,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127339837] [2023-02-14 13:54:45,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127339837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:45,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:45,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:54:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190613937] [2023-02-14 13:54:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:45,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:54:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:54:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:54:45,220 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:54:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:45,433 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-14 13:54:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:54:45,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2023-02-14 13:54:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:45,434 INFO L225 Difference]: With dead ends: 134 [2023-02-14 13:54:45,434 INFO L226 Difference]: Without dead ends: 134 [2023-02-14 13:54:45,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-14 13:54:45,435 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 275 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:45,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 411 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-14 13:54:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2023-02-14 13:54:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.380281690140845) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-02-14 13:54:45,437 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 44 [2023-02-14 13:54:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:45,437 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-02-14 13:54:45,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:54:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-02-14 13:54:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:54:45,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:45,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:45,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 13:54:45,438 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2023-02-14 13:54:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:45,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468474875] [2023-02-14 13:54:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:45,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:45,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468474875] [2023-02-14 13:54:45,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468474875] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:45,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832850894] [2023-02-14 13:54:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:45,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:45,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:45,802 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:54:45,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 13:54:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:45,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 13:54:45,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:46,152 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 17 treesize of output 9 [2023-02-14 13:54:46,198 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1614 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1614)))) is different from true [2023-02-14 13:54:46,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:46,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-14 13:54:46,238 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 25 treesize of output 13 [2023-02-14 13:54:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:54:46,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:46,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array Int Int)) (|v_node_create_~temp~0#1.base_41| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41| v_ArrVal_1618) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_41| |c_#StackHeapBarrier|))))) is different from false [2023-02-14 13:54:46,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832850894] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:46,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:54:46,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-14 13:54:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478552443] [2023-02-14 13:54:46,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:46,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 13:54:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 13:54:46,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2023-02-14 13:54:46,321 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:54:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:46,741 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-02-14 13:54:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 13:54:46,741 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-14 13:54:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:46,742 INFO L225 Difference]: With dead ends: 90 [2023-02-14 13:54:46,742 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 13:54:46,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2023-02-14 13:54:46,742 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 381 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:46,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 591 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 418 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2023-02-14 13:54:46,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 13:54:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2023-02-14 13:54:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:54:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-14 13:54:46,744 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 46 [2023-02-14 13:54:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:46,744 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-14 13:54:46,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:54:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-14 13:54:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:54:46,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:46,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:46,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:46,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:46,953 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2023-02-14 13:54:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:46,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112346700] [2023-02-14 13:54:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:47,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:47,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112346700] [2023-02-14 13:54:47,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112346700] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:47,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20717995] [2023-02-14 13:54:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:47,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:47,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:47,896 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:54:47,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 13:54:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:48,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 93 conjunts are in the unsatisfiable core [2023-02-14 13:54:48,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:48,077 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-02-14 13:54:48,273 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:54:48,274 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-02-14 13:54:48,363 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-02-14 13:54:48,474 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:54:48,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 13:54:48,603 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:54:48,603 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-02-14 13:54:48,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-14 13:54:48,707 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1782)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1781)))) is different from true [2023-02-14 13:54:48,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:48,749 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:54:48,749 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 2 case distinctions, treesize of input 45 treesize of output 43 [2023-02-14 13:54:48,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:48,756 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 14 treesize of output 16 [2023-02-14 13:54:48,778 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-02-14 13:54:48,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-02-14 13:54:48,839 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 15 treesize of output 7 [2023-02-14 13:54:48,976 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:54:48,976 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-02-14 13:54:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:54:49,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:49,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20717995] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:49,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:54:49,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2023-02-14 13:54:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788375966] [2023-02-14 13:54:49,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:49,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 13:54:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 13:54:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2023-02-14 13:54:49,157 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:54:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:50,696 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2023-02-14 13:54:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 13:54:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-14 13:54:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:50,697 INFO L225 Difference]: With dead ends: 183 [2023-02-14 13:54:50,697 INFO L226 Difference]: Without dead ends: 183 [2023-02-14 13:54:50,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=383, Invalid=3402, Unknown=1, NotChecked=120, Total=3906 [2023-02-14 13:54:50,699 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 559 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:50,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1079 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1613 Invalid, 0 Unknown, 184 Unchecked, 0.8s Time] [2023-02-14 13:54:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-14 13:54:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2023-02-14 13:54:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:54:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-02-14 13:54:50,701 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 46 [2023-02-14 13:54:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:50,702 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-02-14 13:54:50,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:54:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-02-14 13:54:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:54:50,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:50,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:50,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:50,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 13:54:50,909 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2023-02-14 13:54:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:50,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328595118] [2023-02-14 13:54:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328595118] [2023-02-14 13:54:52,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328595118] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737578041] [2023-02-14 13:54:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:52,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:52,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:52,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:54:52,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 13:54:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:52,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 114 conjunts are in the unsatisfiable core [2023-02-14 13:54:52,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:52,511 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-02-14 13:54:52,806 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:54:52,807 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-02-14 13:54:52,909 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-02-14 13:54:52,913 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-02-14 13:54:53,053 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:54:53,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-14 13:54:53,056 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 18 treesize of output 20 [2023-02-14 13:54:53,246 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:54:53,246 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2023-02-14 13:54:53,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-02-14 13:54:53,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:54:53,259 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:54:53,385 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1959)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1960) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:54:53,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:53,429 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:54:53,429 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 2 case distinctions, treesize of input 69 treesize of output 59 [2023-02-14 13:54:53,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:53,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:53,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:53,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 13:54:53,453 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:54:53,453 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 28 treesize of output 30 [2023-02-14 13:54:53,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2023-02-14 13:54:53,703 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-14 13:54:53,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2023-02-14 13:54:53,710 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:54:53,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-14 13:54:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:54:53,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:54,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737578041] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:54,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:54:54,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 51 [2023-02-14 13:54:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065332224] [2023-02-14 13:54:54,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:54,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 13:54:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 13:54:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3016, Unknown=1, NotChecked=110, Total=3306 [2023-02-14 13:54:54,167 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:54:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:58,240 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2023-02-14 13:54:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 13:54:58,241 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-14 13:54:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:58,241 INFO L225 Difference]: With dead ends: 215 [2023-02-14 13:54:58,242 INFO L226 Difference]: Without dead ends: 215 [2023-02-14 13:54:58,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=534, Invalid=5475, Unknown=1, NotChecked=152, Total=6162 [2023-02-14 13:54:58,243 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 603 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:58,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 2355 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3163 Invalid, 0 Unknown, 150 Unchecked, 1.6s Time] [2023-02-14 13:54:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-14 13:54:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 105. [2023-02-14 13:54:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3375) internal successors, (107), 98 states have internal predecessors, (107), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:54:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-02-14 13:54:58,246 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 46 [2023-02-14 13:54:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:58,246 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-02-14 13:54:58,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:54:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-02-14 13:54:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:54:58,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:58,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:58,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:58,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 13:54:58,462 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:54:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2023-02-14 13:54:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:58,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770817741] [2023-02-14 13:54:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:54:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:54:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:59,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770817741] [2023-02-14 13:54:59,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770817741] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:59,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231802160] [2023-02-14 13:54:59,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:59,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:59,190 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:54:59,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 13:54:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:59,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 13:54:59,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:59,355 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-02-14 13:54:59,384 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-02-14 13:54:59,403 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-14 13:54:59,432 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:54:59,432 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-02-14 13:54:59,468 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-02-14 13:54:59,516 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:54:59,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:54:59,734 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 18 treesize of output 10 [2023-02-14 13:54:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:59,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-14 13:54:59,959 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 13:54:59,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 29 [2023-02-14 13:55:00,195 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:55:00,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-14 13:55:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:00,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 13:55:00,296 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 25 treesize of output 13 [2023-02-14 13:55:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-14 13:55:00,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:04,410 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2155) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:55:06,433 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2155) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:55:10,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2155) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:55:10,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231802160] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:10,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:10,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2023-02-14 13:55:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035248323] [2023-02-14 13:55:10,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:10,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 13:55:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:10,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 13:55:10,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2149, Unknown=58, NotChecked=388, Total=2756 [2023-02-14 13:55:10,632 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:12,779 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2023-02-14 13:55:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 13:55:12,780 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-14 13:55:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:12,781 INFO L225 Difference]: With dead ends: 216 [2023-02-14 13:55:12,782 INFO L226 Difference]: Without dead ends: 216 [2023-02-14 13:55:12,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=637, Invalid=4575, Unknown=60, NotChecked=580, Total=5852 [2023-02-14 13:55:12,783 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1821 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:12,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 854 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1404 Invalid, 2 Unknown, 113 Unchecked, 0.7s Time] [2023-02-14 13:55:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-14 13:55:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 106. [2023-02-14 13:55:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:55:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-02-14 13:55:12,786 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 51 [2023-02-14 13:55:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:12,786 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-02-14 13:55:12,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-02-14 13:55:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:55:12,787 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:12,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:12,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-14 13:55:12,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:12,995 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:55:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2023-02-14 13:55:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:12,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932031078] [2023-02-14 13:55:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932031078] [2023-02-14 13:55:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932031078] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231915486] [2023-02-14 13:55:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:14,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:14,003 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:55:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 13:55:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:14,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-14 13:55:14,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:14,191 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-02-14 13:55:14,234 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-02-14 13:55:14,253 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-14 13:55:14,271 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:55:14,271 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-02-14 13:55:14,308 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-02-14 13:55:14,387 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:55:14,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:55:14,655 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 21 [2023-02-14 13:55:14,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 [2023-02-14 13:55:14,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:14,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-02-14 13:55:14,860 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:55:14,860 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 13:55:14,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 24 treesize of output 19 [2023-02-14 13:55:14,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:14,868 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 0 case distinctions, treesize of input 31 treesize of output 24 [2023-02-14 13:55:15,148 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:55:15,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-02-14 13:55:15,152 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 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-14 13:55:15,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:15,219 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 38 treesize of output 36 [2023-02-14 13:55:15,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:15,224 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 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-14 13:55:15,283 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 31 treesize of output 19 [2023-02-14 13:55:15,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-14 13:55:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-14 13:55:15,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:15,502 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-14 13:55:16,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231915486] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:16,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:16,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2023-02-14 13:55:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354351707] [2023-02-14 13:55:16,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:16,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 13:55:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:16,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 13:55:16,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2536, Unknown=41, NotChecked=206, Total=2970 [2023-02-14 13:55:16,294 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:18,725 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2023-02-14 13:55:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:55:18,726 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-14 13:55:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:18,726 INFO L225 Difference]: With dead ends: 197 [2023-02-14 13:55:18,726 INFO L226 Difference]: Without dead ends: 197 [2023-02-14 13:55:18,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=487, Invalid=4172, Unknown=41, NotChecked=270, Total=4970 [2023-02-14 13:55:18,728 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1440 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:18,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 844 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1557 Invalid, 0 Unknown, 153 Unchecked, 0.9s Time] [2023-02-14 13:55:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-14 13:55:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2023-02-14 13:55:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 112 states have internal predecessors, (124), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:55:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2023-02-14 13:55:18,731 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 51 [2023-02-14 13:55:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:18,731 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2023-02-14 13:55:18,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2023-02-14 13:55:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:55:18,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:18,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:18,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-14 13:55:18,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:18,938 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:55:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2023-02-14 13:55:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:18,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648490370] [2023-02-14 13:55:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648490370] [2023-02-14 13:55:20,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648490370] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:20,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310005598] [2023-02-14 13:55:20,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:55:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:20,054 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:55:20,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 13:55:20,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:55:20,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:55:20,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 145 conjunts are in the unsatisfiable core [2023-02-14 13:55:20,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:20,264 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-02-14 13:55:20,478 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:55:20,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:55:20,560 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-02-14 13:55:20,563 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-02-14 13:55:20,670 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 13:55:20,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2023-02-14 13:55:20,674 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 27 treesize of output 22 [2023-02-14 13:55:21,117 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2023-02-14 13:55:21,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 77 [2023-02-14 13:55:21,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:21,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:21,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:21,134 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 13:55:21,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2023-02-14 13:55:21,148 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-14 13:55:21,149 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 20 treesize of output 22 [2023-02-14 13:55:22,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:22,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:22,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:22,190 INFO L321 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2023-02-14 13:55:22,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 42 [2023-02-14 13:55:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:55:22,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:25,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310005598] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:25,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:25,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2023-02-14 13:55:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985308483] [2023-02-14 13:55:25,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:25,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-14 13:55:25,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-14 13:55:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3919, Unknown=3, NotChecked=0, Total=4160 [2023-02-14 13:55:25,343 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:55:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:28,096 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2023-02-14 13:55:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-14 13:55:28,096 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2023-02-14 13:55:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:28,097 INFO L225 Difference]: With dead ends: 121 [2023-02-14 13:55:28,097 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 13:55:28,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=532, Invalid=7121, Unknown=3, NotChecked=0, Total=7656 [2023-02-14 13:55:28,099 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 221 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:28,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1685 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1892 Invalid, 1 Unknown, 0 Unchecked, 1.1s Time] [2023-02-14 13:55:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 13:55:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-02-14 13:55:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 112 states have internal predecessors, (123), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:55:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2023-02-14 13:55:28,101 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 51 [2023-02-14 13:55:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:28,102 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2023-02-14 13:55:28,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:55:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2023-02-14 13:55:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 13:55:28,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:28,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:28,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-14 13:55:28,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-14 13:55:28,308 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:55:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2023-02-14 13:55:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:28,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887351117] [2023-02-14 13:55:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:28,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:29,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887351117] [2023-02-14 13:55:29,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887351117] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:29,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230896613] [2023-02-14 13:55:29,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:29,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:29,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:29,115 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:55:29,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 13:55:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:29,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2023-02-14 13:55:29,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:29,327 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-02-14 13:55:29,513 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:55:29,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:55:29,595 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-02-14 13:55:29,705 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:55:29,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-14 13:55:29,834 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:55:29,835 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2023-02-14 13:55:29,839 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-02-14 13:55:29,847 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 7 treesize of output 3 [2023-02-14 13:55:30,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:30,011 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 13:55:30,012 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 2 case distinctions, treesize of input 43 treesize of output 38 [2023-02-14 13:55:30,021 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:55:30,022 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 15 treesize of output 15 [2023-02-14 13:55:30,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:30,026 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 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-14 13:55:30,298 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-14 13:55:30,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2023-02-14 13:55:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:55:30,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:30,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230896613] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:30,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:30,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2023-02-14 13:55:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012565573] [2023-02-14 13:55:30,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:30,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 13:55:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 13:55:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2581, Unknown=0, NotChecked=0, Total=2756 [2023-02-14 13:55:30,628 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:55:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:32,248 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2023-02-14 13:55:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:55:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-14 13:55:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:32,249 INFO L225 Difference]: With dead ends: 120 [2023-02-14 13:55:32,249 INFO L226 Difference]: Without dead ends: 120 [2023-02-14 13:55:32,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=339, Invalid=4217, Unknown=0, NotChecked=0, Total=4556 [2023-02-14 13:55:32,250 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 137 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:32,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1593 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-14 13:55:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-14 13:55:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2023-02-14 13:55:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.297872340425532) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:55:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-14 13:55:32,253 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 53 [2023-02-14 13:55:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:32,253 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-14 13:55:32,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:55:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-14 13:55:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 13:55:32,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:32,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:32,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-14 13:55:32,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-14 13:55:32,458 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:55:32,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2023-02-14 13:55:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:32,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659613151] [2023-02-14 13:55:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659613151] [2023-02-14 13:55:33,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659613151] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851719105] [2023-02-14 13:55:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:33,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:33,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:33,662 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:55:33,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 13:55:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:33,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 110 conjunts are in the unsatisfiable core [2023-02-14 13:55:33,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:33,879 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-02-14 13:55:33,920 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-02-14 13:55:33,944 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2922 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2922))))) is different from true [2023-02-14 13:55:33,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:33,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:55:33,978 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-02-14 13:55:34,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:34,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:55:34,430 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 26 treesize of output 14 [2023-02-14 13:55:34,434 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-02-14 13:55:34,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:34,439 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 11 treesize of output 7 [2023-02-14 13:55:34,443 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 7 treesize of output 3 [2023-02-14 13:55:34,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:34,721 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 14 treesize of output 16 [2023-02-14 13:55:34,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:34,731 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 34 treesize of output 32 [2023-02-14 13:55:34,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:34,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:34,745 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:55:34,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 21 treesize of output 34 [2023-02-14 13:55:34,759 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:55:34,759 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 15 treesize of output 15 [2023-02-14 13:55:35,344 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-02-14 13:55:35,344 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 56 treesize of output 57 [2023-02-14 13:55:35,366 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-14 13:55:35,366 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 38 treesize of output 33 [2023-02-14 13:55:35,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:35,686 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:55:35,686 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 98 treesize of output 101 [2023-02-14 13:55:35,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:35,714 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:55:35,715 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 103 treesize of output 110 [2023-02-14 13:55:35,765 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-02-14 13:55:35,826 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-02-14 13:55:35,844 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-02-14 13:55:36,106 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 15 treesize of output 7 [2023-02-14 13:55:36,109 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 34 treesize of output 18 [2023-02-14 13:55:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-14 13:55:36,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:36,512 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-14 13:55:48,627 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (forall ((v_ArrVal_2944 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_subst_2 Int)) (or (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) .cse0 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= (+ .cse0 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945) v_subst_2))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))) (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse2)) (forall ((v_subst_1 Int)) (let ((.cse4 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945))) (or (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store (store .cse3 v_subst_1 (store (select .cse3 v_subst_1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse4 (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2943))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (<= (+ .cse2 4) (select .cse4 v_subst_1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0))))))) is different from false [2023-02-14 13:55:48,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851719105] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:48,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:48,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 51 [2023-02-14 13:55:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900751796] [2023-02-14 13:55:48,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:48,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 13:55:48,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 13:55:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3261, Unknown=23, NotChecked=354, Total=3906 [2023-02-14 13:55:48,633 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:53,404 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2023-02-14 13:55:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 13:55:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2023-02-14 13:55:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:53,405 INFO L225 Difference]: With dead ends: 181 [2023-02-14 13:55:53,405 INFO L226 Difference]: Without dead ends: 181 [2023-02-14 13:55:53,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1859 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=728, Invalid=6401, Unknown=23, NotChecked=504, Total=7656 [2023-02-14 13:55:53,406 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 644 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:53,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1841 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2658 Invalid, 0 Unknown, 168 Unchecked, 2.0s Time] [2023-02-14 13:55:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-14 13:55:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 105. [2023-02-14 13:55:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 98 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:55:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-14 13:55:53,409 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 56 [2023-02-14 13:55:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:53,409 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-14 13:55:53,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-14 13:55:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 13:55:53,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:53,410 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:53,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 13:55:53,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:53,616 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:55:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2023-02-14 13:55:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:53,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160621450] [2023-02-14 13:55:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-14 13:55:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-14 13:55:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-02-14 13:55:53,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160621450] [2023-02-14 13:55:53,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160621450] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:53,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887095145] [2023-02-14 13:55:53,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 13:55:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:53,691 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:55:53,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-14 13:55:53,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-14 13:55:53,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:55:53,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:55:53,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 13:55:53,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:55:53,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887095145] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:53,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:55:53,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-14 13:55:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292264458] [2023-02-14 13:55:53,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:53,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:55:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:55:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:55:53,954 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:55:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:53,963 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-02-14 13:55:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:55:53,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2023-02-14 13:55:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:53,964 INFO L225 Difference]: With dead ends: 83 [2023-02-14 13:55:53,964 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 13:55:53,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:55:53,964 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:53,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:55:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 13:55:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-14 13:55:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:55:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-14 13:55:53,966 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2023-02-14 13:55:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:53,967 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-14 13:55:53,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:55:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-14 13:55:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 13:55:53,967 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:53,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:53,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-14 13:55:54,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:54,174 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:55:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2023-02-14 13:55:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:54,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740858088] [2023-02-14 13:55:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:55,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740858088] [2023-02-14 13:55:56,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740858088] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:56,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735045823] [2023-02-14 13:55:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:56,373 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:55:56,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-14 13:55:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:56,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-14 13:55:56,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:56,592 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-02-14 13:55:56,645 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-02-14 13:55:56,804 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:55:56,804 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-02-14 13:55:56,958 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 11 treesize of output 7 [2023-02-14 13:55:56,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:55:57,097 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 13:55:57,097 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-02-14 13:55:57,259 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 11 treesize of output 7 [2023-02-14 13:55:57,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:57,264 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 21 treesize of output 20 [2023-02-14 13:55:57,272 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 11 treesize of output 7 [2023-02-14 13:55:57,495 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:55:57,495 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-14 13:55:57,499 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 20 treesize of output 22 [2023-02-14 13:55:57,505 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-02-14 13:55:57,776 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:55:57,776 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2023-02-14 13:55:57,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-14 13:55:57,788 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:55:58,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:58,107 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 13:55:58,107 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 2 case distinctions, treesize of input 68 treesize of output 55 [2023-02-14 13:55:58,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:58,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:58,121 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-14 13:55:58,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 33 [2023-02-14 13:55:58,135 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:55:58,135 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 15 treesize of output 15 [2023-02-14 13:55:58,145 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 20 treesize of output 15 [2023-02-14 13:55:59,103 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:55:59,103 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 92 [2023-02-14 13:55:59,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:59,126 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:55:59,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 59 [2023-02-14 13:55:59,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:59,134 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 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-14 13:55:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:59,259 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:55:59,260 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 2 case distinctions, treesize of input 65 treesize of output 59 [2023-02-14 13:55:59,265 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 18 treesize of output 20 [2023-02-14 13:55:59,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:59,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:59,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 13:55:59,374 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:55:59,374 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2023-02-14 13:55:59,379 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 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-14 13:55:59,514 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 15 treesize of output 7 [2023-02-14 13:55:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:55:59,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:59,738 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-14 13:55:59,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3351) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-14 13:56:00,623 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| Int) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3366 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3367 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3368 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3367)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3368))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3366) .cse0 v_ArrVal_3352) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3354) (select (select (store (store .cse1 .cse0 v_ArrVal_3351) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3353) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (<= 0 (select (select .cse2 .cse3) .cse4))))))) is different from false [2023-02-14 13:56:00,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735045823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:00,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:00,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2023-02-14 13:56:00,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203143987] [2023-02-14 13:56:00,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:00,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-14 13:56:00,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-14 13:56:00,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5121, Unknown=3, NotChecked=438, Total=5852 [2023-02-14 13:56:00,626 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:04,422 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-02-14 13:56:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 13:56:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2023-02-14 13:56:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:04,423 INFO L225 Difference]: With dead ends: 102 [2023-02-14 13:56:04,423 INFO L226 Difference]: Without dead ends: 102 [2023-02-14 13:56:04,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=717, Invalid=8412, Unknown=3, NotChecked=570, Total=9702 [2023-02-14 13:56:04,424 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 785 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:04,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1093 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 13:56:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-14 13:56:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2023-02-14 13:56:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:56:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-14 13:56:04,426 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 58 [2023-02-14 13:56:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:04,426 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-14 13:56:04,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-14 13:56:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-14 13:56:04,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:04,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:04,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:04,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-14 13:56:04,633 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:56:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2023-02-14 13:56:04,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:04,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555305544] [2023-02-14 13:56:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555305544] [2023-02-14 13:56:06,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555305544] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745205669] [2023-02-14 13:56:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:06,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:06,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:06,277 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:56:06,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-14 13:56:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:06,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-14 13:56:06,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:06,509 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-02-14 13:56:06,549 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-02-14 13:56:06,675 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:56:06,676 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-02-14 13:56:06,789 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 11 treesize of output 7 [2023-02-14 13:56:06,892 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 13:56:06,892 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-02-14 13:56:07,008 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 11 treesize of output 7 [2023-02-14 13:56:07,179 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:07,179 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-14 13:56:07,380 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:07,380 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2023-02-14 13:56:07,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-02-14 13:56:07,387 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 7 treesize of output 3 [2023-02-14 13:56:07,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:07,646 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 13:56:07,646 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 2 case distinctions, treesize of input 46 treesize of output 37 [2023-02-14 13:56:07,653 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:56:07,654 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 15 treesize of output 15 [2023-02-14 13:56:07,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:07,674 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 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-14 13:56:08,274 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:56:08,274 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 73 [2023-02-14 13:56:08,287 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:08,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2023-02-14 13:56:08,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:08,379 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:08,379 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 2 case distinctions, treesize of input 60 treesize of output 52 [2023-02-14 13:56:08,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:08,386 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 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-14 13:56:08,464 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 32 treesize of output 20 [2023-02-14 13:56:08,632 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:08,632 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2023-02-14 13:56:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:08,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:09,057 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2023-02-14 13:56:09,057 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 42 treesize of output 41 [2023-02-14 13:56:09,061 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) is different from false [2023-02-14 13:56:09,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-14 13:56:09,240 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2023-02-14 13:56:09,249 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-14 13:56:09,261 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2023-02-14 13:56:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745205669] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:09,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:09,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 63 [2023-02-14 13:56:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519490950] [2023-02-14 13:56:09,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:09,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-02-14 13:56:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-02-14 13:56:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4197, Unknown=170, NotChecked=680, Total=5256 [2023-02-14 13:56:09,461 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:12,655 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2023-02-14 13:56:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 13:56:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2023-02-14 13:56:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:12,656 INFO L225 Difference]: With dead ends: 134 [2023-02-14 13:56:12,657 INFO L226 Difference]: Without dead ends: 134 [2023-02-14 13:56:12,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=639, Invalid=7385, Unknown=186, NotChecked=910, Total=9120 [2023-02-14 13:56:12,658 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 938 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:12,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1031 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-14 13:56:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-14 13:56:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2023-02-14 13:56:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:56:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-02-14 13:56:12,660 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 62 [2023-02-14 13:56:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:12,660 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-02-14 13:56:12,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-02-14 13:56:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-14 13:56:12,661 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:12,661 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:12,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:12,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-14 13:56:12,867 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:56:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2023-02-14 13:56:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:12,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865854705] [2023-02-14 13:56:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:15,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865854705] [2023-02-14 13:56:15,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865854705] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:15,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320084292] [2023-02-14 13:56:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:15,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:15,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:15,828 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:56:15,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-14 13:56:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 151 conjunts are in the unsatisfiable core [2023-02-14 13:56:16,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:16,057 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-02-14 13:56:16,150 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-02-14 13:56:16,307 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:56:16,307 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-02-14 13:56:16,697 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-14 13:56:16,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-14 13:56:16,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:56:16,888 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 11 treesize of output 7 [2023-02-14 13:56:16,894 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 11 treesize of output 7 [2023-02-14 13:56:17,118 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:17,119 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2023-02-14 13:56:17,127 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-02-14 13:56:17,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:17,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 13:56:17,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:17,876 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:17,876 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 2 case distinctions, treesize of input 81 treesize of output 65 [2023-02-14 13:56:17,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:17,903 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-02-14 13:56:17,904 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 25 treesize of output 42 [2023-02-14 13:56:17,920 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-02-14 13:56:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:17,939 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-02-14 13:56:17,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2023-02-14 13:56:18,885 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:56:18,885 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2023-02-14 13:56:18,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:18,911 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:56:18,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2023-02-14 13:56:19,038 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:19,038 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 2 case distinctions, treesize of input 79 treesize of output 63 [2023-02-14 13:56:19,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:19,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 13:56:19,395 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-14 13:56:19,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2023-02-14 13:56:19,665 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:56:19,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-14 13:56:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:19,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:20,204 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 4))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2023-02-14 13:56:23,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320084292] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:23,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:23,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 76 [2023-02-14 13:56:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167571459] [2023-02-14 13:56:23,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:23,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-14 13:56:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-14 13:56:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=7465, Unknown=97, NotChecked=174, Total=8010 [2023-02-14 13:56:23,114 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:30,735 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2023-02-14 13:56:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-14 13:56:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2023-02-14 13:56:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:30,736 INFO L225 Difference]: With dead ends: 156 [2023-02-14 13:56:30,736 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 13:56:30,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=924, Invalid=12555, Unknown=97, NotChecked=230, Total=13806 [2023-02-14 13:56:30,737 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2110 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:30,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 1281 Invalid, 3119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3063 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-14 13:56:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 13:56:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2023-02-14 13:56:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:56:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-14 13:56:30,739 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 62 [2023-02-14 13:56:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:30,739 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-14 13:56:30,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-14 13:56:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-14 13:56:30,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:30,740 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:30,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-14 13:56:30,940 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:56:30,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2023-02-14 13:56:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:30,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984851933] [2023-02-14 13:56:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:32,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:32,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984851933] [2023-02-14 13:56:32,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984851933] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:32,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106218170] [2023-02-14 13:56:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:32,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:32,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:32,703 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:56:32,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-14 13:56:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 124 conjunts are in the unsatisfiable core [2023-02-14 13:56:32,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:32,958 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-02-14 13:56:33,008 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-02-14 13:56:33,170 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:56:33,170 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-02-14 13:56:33,299 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 11 treesize of output 7 [2023-02-14 13:56:33,410 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 13:56:33,410 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-02-14 13:56:33,547 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 11 treesize of output 7 [2023-02-14 13:56:33,716 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:33,717 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-14 13:56:33,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:56:33,950 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:33,950 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2023-02-14 13:56:33,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2023-02-14 13:56:34,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:34,297 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 57 treesize of output 53 [2023-02-14 13:56:34,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:34,309 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:34,309 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 2 case distinctions, treesize of input 52 treesize of output 50 [2023-02-14 13:56:34,319 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:56:34,319 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 15 treesize of output 15 [2023-02-14 13:56:34,958 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:56:34,973 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2023-02-14 13:56:34,973 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2023-02-14 13:56:34,999 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:35,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 83 [2023-02-14 13:56:35,146 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-14 13:56:35,146 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 89 [2023-02-14 13:56:35,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,151 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 0 case distinctions, treesize of input 94 treesize of output 86 [2023-02-14 13:56:35,159 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 35 treesize of output 29 [2023-02-14 13:56:35,292 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 122 treesize of output 90 [2023-02-14 13:56:35,855 INFO L321 Elim1Store]: treesize reduction 20, result has 71.0 percent of original size [2023-02-14 13:56:35,855 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 105 [2023-02-14 13:56:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:36,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:36,400 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-14 13:56:36,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-14 13:56:36,420 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-02-14 13:56:36,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-14 13:56:36,446 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-14 13:56:36,462 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-14 13:56:36,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| Int) (v_ArrVal_3975 (Array Int Int)) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3976 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3975)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3976))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_3964) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-14 13:56:36,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106218170] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:36,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:36,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 66 [2023-02-14 13:56:36,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945687190] [2023-02-14 13:56:36,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:36,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-14 13:56:36,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:36,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-14 13:56:36,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=4164, Unknown=55, NotChecked=952, Total=5402 [2023-02-14 13:56:36,542 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:39,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 13:56:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:42,776 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2023-02-14 13:56:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-14 13:56:42,776 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2023-02-14 13:56:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:42,777 INFO L225 Difference]: With dead ends: 110 [2023-02-14 13:56:42,777 INFO L226 Difference]: Without dead ends: 110 [2023-02-14 13:56:42,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=650, Invalid=7511, Unknown=57, NotChecked=1288, Total=9506 [2023-02-14 13:56:42,777 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 750 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 28 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:42,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1191 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1975 Invalid, 6 Unknown, 0 Unchecked, 3.1s Time] [2023-02-14 13:56:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-14 13:56:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2023-02-14 13:56:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:56:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-14 13:56:42,779 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 63 [2023-02-14 13:56:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:42,780 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-14 13:56:42,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-14 13:56:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-14 13:56:42,780 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:42,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:42,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:42,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:42,988 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:56:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2023-02-14 13:56:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:42,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219150544] [2023-02-14 13:56:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:46,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219150544] [2023-02-14 13:56:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219150544] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185463181] [2023-02-14 13:56:46,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:46,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:46,257 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:56:46,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-14 13:56:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:46,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 203 conjunts are in the unsatisfiable core [2023-02-14 13:56:46,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:46,504 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-02-14 13:56:46,509 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-02-14 13:56:46,570 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-02-14 13:56:46,572 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-02-14 13:56:46,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:56:46,877 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:56:46,877 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-02-14 13:56:46,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:56:47,072 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 11 treesize of output 7 [2023-02-14 13:56:47,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-14 13:56:47,078 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-02-14 13:56:47,467 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:56:47,467 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 14 treesize of output 20 [2023-02-14 13:56:47,472 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-02-14 13:56:47,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:47,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:56:47,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:47,510 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:47,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-02-14 13:56:47,706 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 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:56:47,722 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-02-14 13:56:47,731 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 11 treesize of output 7 [2023-02-14 13:56:47,975 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:47,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2023-02-14 13:56:47,982 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 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:56:47,987 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 31 treesize of output 26 [2023-02-14 13:56:48,365 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:56:48,365 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 39 [2023-02-14 13:56:48,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:48,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:56:48,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 13:56:48,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:56:48,385 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-02-14 13:56:48,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:48,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:56:48,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:48,886 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:48,887 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 2 case distinctions, treesize of input 92 treesize of output 74 [2023-02-14 13:56:48,905 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 13:56:48,905 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 22 treesize of output 36 [2023-02-14 13:56:48,914 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-02-14 13:56:48,929 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:56:48,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-14 13:56:48,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:48,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:48,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 13:56:50,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:50,126 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 13 treesize of output 9 [2023-02-14 13:56:50,637 INFO L321 Elim1Store]: treesize reduction 151, result has 10.7 percent of original size [2023-02-14 13:56:50,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 105 [2023-02-14 13:56:50,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:50,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2023-02-14 13:56:50,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:50,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2023-02-14 13:56:50,849 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-14 13:56:50,849 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 160 [2023-02-14 13:56:50,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:50,869 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:56:50,870 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 2 case distinctions, treesize of input 176 treesize of output 144 [2023-02-14 13:56:50,878 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 0 case distinctions, treesize of input 46 treesize of output 48 [2023-02-14 13:56:51,410 INFO L321 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2023-02-14 13:56:51,411 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 75 [2023-02-14 13:56:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:51,421 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:56:51,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-14 13:56:51,580 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 15 treesize of output 7 [2023-02-14 13:56:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:51,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:52,022 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2))))))) is different from false [2023-02-14 13:56:52,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4182) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4183)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2023-02-14 13:56:53,987 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| Int) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4199 (Array Int Int)) (v_ArrVal_4201 (Array Int Int)) (v_ArrVal_4202 (Array Int Int)) (v_ArrVal_4200 Int) (v_ArrVal_4182 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4201)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4202))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse11) .cse10))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse11) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4182) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4185)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4187))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4199))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4183))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4186) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (<= (+ .cse2 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4200) .cse1))) (not (<= 0 .cse10)) (not (<= 0 .cse2)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select .cse8 .cse2) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|) 0)))))))) is different from false [2023-02-14 13:56:53,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185463181] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:53,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:53,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 79 [2023-02-14 13:56:53,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810672416] [2023-02-14 13:56:53,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:53,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-02-14 13:56:53,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:53,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-02-14 13:56:53,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8208, Unknown=13, NotChecked=552, Total=9120 [2023-02-14 13:56:53,992 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:57:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:02,658 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2023-02-14 13:57:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-14 13:57:02,659 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2023-02-14 13:57:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:02,659 INFO L225 Difference]: With dead ends: 108 [2023-02-14 13:57:02,659 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 13:57:02,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3037 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1015, Invalid=13987, Unknown=16, NotChecked=732, Total=15750 [2023-02-14 13:57:02,660 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 716 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 2978 mSolverCounterSat, 32 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2978 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:02,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1053 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2978 Invalid, 4 Unknown, 0 Unchecked, 2.2s Time] [2023-02-14 13:57:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 13:57:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-02-14 13:57:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:57:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-02-14 13:57:02,662 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 64 [2023-02-14 13:57:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:02,663 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-02-14 13:57:02,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:57:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-02-14 13:57:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-14 13:57:02,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:02,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:02,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:02,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-14 13:57:02,869 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:57:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2023-02-14 13:57:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:02,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805668022] [2023-02-14 13:57:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:57:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:57:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:57:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:57:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:05,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805668022] [2023-02-14 13:57:05,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805668022] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:05,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717498082] [2023-02-14 13:57:05,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:57:05,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:05,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:05,139 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:05,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-14 13:57:05,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:57:05,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:57:05,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 188 conjunts are in the unsatisfiable core [2023-02-14 13:57:05,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:05,425 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-02-14 13:57:05,472 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-02-14 13:57:05,511 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-02-14 13:57:05,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:05,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:57:05,797 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-02-14 13:57:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:05,800 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 11 treesize of output 7 [2023-02-14 13:57:05,997 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:57:05,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:57:06,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:06,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:06,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2023-02-14 13:57:06,172 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-02-14 13:57:06,371 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:57:06,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-02-14 13:57:06,653 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:57:06,654 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2023-02-14 13:57:06,658 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 7 treesize of output 3 [2023-02-14 13:57:06,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:06,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:57:06,666 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-02-14 13:57:07,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:07,070 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 14 treesize of output 16 [2023-02-14 13:57:07,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:07,087 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:07,087 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 2 case distinctions, treesize of input 67 treesize of output 57 [2023-02-14 13:57:07,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:07,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:07,105 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 13:57:07,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 42 [2023-02-14 13:57:07,125 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:57:07,125 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 15 treesize of output 15 [2023-02-14 13:57:08,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:08,793 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-14 13:57:08,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 209 treesize of output 122 [2023-02-14 13:57:08,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:08,819 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-02-14 13:57:08,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 121 [2023-02-14 13:57:09,186 INFO L321 Elim1Store]: treesize reduction 88, result has 27.9 percent of original size [2023-02-14 13:57:09,187 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 160 [2023-02-14 13:57:09,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:09,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:09,203 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2023-02-14 13:57:09,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 147 [2023-02-14 13:57:11,151 INFO L321 Elim1Store]: treesize reduction 48, result has 72.9 percent of original size [2023-02-14 13:57:11,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 401 treesize of output 467 [2023-02-14 13:57:14,933 INFO L321 Elim1Store]: treesize reduction 172, result has 62.7 percent of original size [2023-02-14 13:57:14,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 362 treesize of output 482 [2023-02-14 13:57:15,157 INFO L321 Elim1Store]: treesize reduction 72, result has 69.6 percent of original size [2023-02-14 13:57:15,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 318 treesize of output 355 [2023-02-14 13:57:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:57:24,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:26,415 INFO L321 Elim1Store]: treesize reduction 18, result has 98.3 percent of original size [2023-02-14 13:57:26,416 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 550 treesize of output 1082 [2023-02-14 13:57:29,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717498082] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:29,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:29,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42] total 78 [2023-02-14 13:57:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633120708] [2023-02-14 13:57:29,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:29,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-02-14 13:57:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-02-14 13:57:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=9300, Unknown=1, NotChecked=0, Total=9702 [2023-02-14 13:57:29,385 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:57:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:41,126 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2023-02-14 13:57:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-14 13:57:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2023-02-14 13:57:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:41,127 INFO L225 Difference]: With dead ends: 178 [2023-02-14 13:57:41,127 INFO L226 Difference]: Without dead ends: 178 [2023-02-14 13:57:41,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3797 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=1308, Invalid=16779, Unknown=3, NotChecked=0, Total=18090 [2023-02-14 13:57:41,129 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1723 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:41,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 1238 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3370 Invalid, 2 Unknown, 0 Unchecked, 2.7s Time] [2023-02-14 13:57:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-14 13:57:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 99. [2023-02-14 13:57:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:57:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-02-14 13:57:41,131 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2023-02-14 13:57:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:41,131 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-02-14 13:57:41,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:57:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-02-14 13:57:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-14 13:57:41,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:41,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:41,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:41,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:41,339 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-14 13:57:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2023-02-14 13:57:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:41,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910130686] [2023-02-14 13:57:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:57:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:57:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:57:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:57:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910130686] [2023-02-14 13:57:43,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910130686] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579700346] [2023-02-14 13:57:43,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:57:43,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:43,999 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-14 13:57:44,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:57:44,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:57:44,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 157 conjunts are in the unsatisfiable core [2023-02-14 13:57:44,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:44,752 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 9 treesize of output 5 [2023-02-14 13:57:44,755 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 7 treesize of output 3 [2023-02-14 13:57:44,811 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-02-14 13:57:45,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:45,088 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 16 treesize of output 11 [2023-02-14 13:57:45,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:45,098 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 18 treesize of output 13 [2023-02-14 13:57:45,104 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:57:45,104 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 15 treesize of output 15 [2023-02-14 13:57:46,408 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:46,409 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:46,430 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-14 13:57:46,431 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 159 treesize of output 106 [2023-02-14 13:57:46,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:46,452 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-02-14 13:57:46,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 84 [2023-02-14 13:57:46,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:46,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:46,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:46,935 INFO L321 Elim1Store]: treesize reduction 156, result has 29.7 percent of original size [2023-02-14 13:57:46,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 143 [2023-02-14 13:57:46,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:46,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:46,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:47,042 INFO L321 Elim1Store]: treesize reduction 116, result has 46.5 percent of original size [2023-02-14 13:57:47,043 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 8 new quantified variables, introduced 18 case distinctions, treesize of input 136 treesize of output 184 [2023-02-14 13:57:52,216 INFO L321 Elim1Store]: treesize reduction 303, result has 45.2 percent of original size [2023-02-14 13:57:52,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 21 new quantified variables, introduced 45 case distinctions, treesize of input 456 treesize of output 478 [2023-02-14 13:57:52,590 INFO L321 Elim1Store]: treesize reduction 264, result has 48.9 percent of original size [2023-02-14 13:57:52,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 477 treesize of output 544 [2023-02-14 13:58:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:58:21,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:27,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:27,094 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 14128 treesize of output 14132