./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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_unequal.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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:27:28,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:27:28,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:27:28,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:27:28,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:27:28,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:27:28,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:27:28,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:27:28,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:27:28,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:27:28,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:27:28,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:27:28,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:27:28,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:27:28,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:27:28,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:27:28,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:27:28,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:27:28,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:27:28,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:27:28,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:27:28,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:27:28,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:27:28,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:27:28,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:27:28,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:27:28,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:27:28,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:27:28,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:27:28,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:27:28,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:27:28,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:27:28,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:27:28,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:27:28,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:27:28,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:27:28,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:27:28,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:27:28,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:27:28,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:27:28,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:27:28,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:27:28,997 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:27:28,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:27:28,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:27:28,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:27:28,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:27:28,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:27:28,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:27:29,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:27:29,000 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:27:29,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:27:29,001 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:27:29,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:27:29,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:27:29,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:27:29,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:27:29,001 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:27:29,002 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:27:29,002 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:27:29,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:27:29,002 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:27:29,002 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:27:29,002 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:27:29,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:27:29,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:27:29,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:27:29,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:27:29,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:27:29,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:27:29,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:27:29,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:27:29,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:27:29,004 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:27:29,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:27:29,004 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:27:29,004 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2023-02-15 13:27:29,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:27:29,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:27:29,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:27:29,257 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:27:29,257 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:27:29,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-02-15 13:27:30,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:27:30,418 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:27:30,419 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-02-15 13:27:30,428 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c53618d/1df614ad576d4e63b81b55904c2886af/FLAGf3ead788e [2023-02-15 13:27:30,439 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c53618d/1df614ad576d4e63b81b55904c2886af [2023-02-15 13:27:30,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:27:30,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:27:30,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:27:30,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:27:30,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:27:30,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc93c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30, skipping insertion in model container [2023-02-15 13:27:30,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:27:30,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:27:30,731 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_unequal.i[24587,24600] [2023-02-15 13:27:30,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:27:30,748 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:27:30,792 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_unequal.i[24587,24600] [2023-02-15 13:27:30,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:27:30,814 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:27:30,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30 WrapperNode [2023-02-15 13:27:30,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:27:30,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:27:30,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:27:30,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:27:30,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,849 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 164 [2023-02-15 13:27:30,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:27:30,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:27:30,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:27:30,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:27:30,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,890 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:27:30,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:27:30,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:27:30,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:27:30,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (1/1) ... [2023-02-15 13:27:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:27:30,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:30,934 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-15 13:27:30,937 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-15 13:27:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:27:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:27:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 13:27:30,958 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 13:27:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:27:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:27:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:27:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:27:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:27:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:27:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:27:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:27:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:27:30,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:27:31,061 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:27:31,063 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:27:31,349 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:27:31,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:27:31,355 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 13:27:31,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:27:31 BoogieIcfgContainer [2023-02-15 13:27:31,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:27:31,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:27:31,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:27:31,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:27:31,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:27:30" (1/3) ... [2023-02-15 13:27:31,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:27:31, skipping insertion in model container [2023-02-15 13:27:31,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:30" (2/3) ... [2023-02-15 13:27:31,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:27:31, skipping insertion in model container [2023-02-15 13:27:31,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:27:31" (3/3) ... [2023-02-15 13:27:31,368 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2023-02-15 13:27:31,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:27:31,383 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2023-02-15 13:27:31,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:27:31,433 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;@40678917, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:27:31,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-02-15 13:27:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 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-15 13:27:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:27:31,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:31,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:27:31,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 895983381, now seen corresponding path program 1 times [2023-02-15 13:27:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:31,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205920833] [2023-02-15 13:27:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:31,659 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-15 13:27:31,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:31,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205920833] [2023-02-15 13:27:31,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205920833] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:31,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:31,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:27:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409509717] [2023-02-15 13:27:31,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:31,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:27:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:27:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:27:31,702 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 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-15 13:27:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:31,832 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2023-02-15 13:27:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:27:31,834 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-15 13:27:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:31,840 INFO L225 Difference]: With dead ends: 130 [2023-02-15 13:27:31,840 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 13:27:31,842 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-15 13:27:31,844 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:31,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:27:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 13:27:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-02-15 13:27:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.955223880597015) internal successors, (131), 122 states have internal predecessors, (131), 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-15 13:27:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-15 13:27:31,873 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 6 [2023-02-15 13:27:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:31,873 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-15 13:27:31,873 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-15 13:27:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2023-02-15 13:27:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:27:31,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:31,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:27:31,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:27:31,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 895983382, now seen corresponding path program 1 times [2023-02-15 13:27:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:31,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117394881] [2023-02-15 13:27:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:31,967 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-15 13:27:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:31,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117394881] [2023-02-15 13:27:31,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117394881] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:31,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:31,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:27:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296215958] [2023-02-15 13:27:31,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:31,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:27:31,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:31,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:27:31,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:27:31,972 INFO L87 Difference]: Start difference. First operand 127 states and 137 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-15 13:27:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:32,047 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2023-02-15 13:27:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:27:32,048 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-15 13:27:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:32,049 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:27:32,049 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:27:32,049 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-15 13:27:32,050 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:32,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 209 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:27:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:27:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-15 13:27:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 120 states have internal predecessors, (129), 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-15 13:27:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2023-02-15 13:27:32,057 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 6 [2023-02-15 13:27:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:32,058 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2023-02-15 13:27:32,058 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-15 13:27:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2023-02-15 13:27:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:27:32,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:32,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:32,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:27:32,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash 229520599, now seen corresponding path program 1 times [2023-02-15 13:27:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391287097] [2023-02-15 13:27:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,171 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-15 13:27:32,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:32,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391287097] [2023-02-15 13:27:32,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391287097] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:32,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:32,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:27:32,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197341516] [2023-02-15 13:27:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:32,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:27:32,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:27:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:27:32,182 INFO L87 Difference]: Start difference. First operand 125 states and 135 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-15 13:27:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:32,292 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2023-02-15 13:27:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:27:32,292 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-15 13:27:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:32,296 INFO L225 Difference]: With dead ends: 132 [2023-02-15 13:27:32,296 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 13:27:32,298 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-15 13:27:32,301 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:32,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 311 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:27:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 13:27:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2023-02-15 13:27:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 68 states have (on average 1.911764705882353) internal successors, (130), 121 states have internal predecessors, (130), 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-15 13:27:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-15 13:27:32,318 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 13 [2023-02-15 13:27:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:32,318 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-15 13:27:32,318 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-15 13:27:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-15 13:27:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:27:32,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:32,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:32,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:27:32,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414876, now seen corresponding path program 1 times [2023-02-15 13:27:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:32,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719474396] [2023-02-15 13:27:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,530 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-15 13:27:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719474396] [2023-02-15 13:27:32,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719474396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:32,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:32,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396974387] [2023-02-15 13:27:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:32,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:27:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:27:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:27:32,533 INFO L87 Difference]: Start difference. First operand 126 states and 136 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-15 13:27:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:32,784 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2023-02-15 13:27:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:32,784 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-15 13:27:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:32,787 INFO L225 Difference]: With dead ends: 126 [2023-02-15 13:27:32,787 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 13:27:32,787 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-15 13:27:32,790 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 13 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:32,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 444 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:27:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 13:27:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2023-02-15 13:27:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 120 states have internal predecessors, (129), 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-15 13:27:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2023-02-15 13:27:32,795 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 22 [2023-02-15 13:27:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:32,796 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2023-02-15 13:27:32,796 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-15 13:27:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2023-02-15 13:27:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:27:32,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:32,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:32,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:27:32,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414877, now seen corresponding path program 1 times [2023-02-15 13:27:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:32,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283460434] [2023-02-15 13:27:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:32,978 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-15 13:27:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:32,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283460434] [2023-02-15 13:27:32,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283460434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:32,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:32,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891791385] [2023-02-15 13:27:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:32,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:27:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:27:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:27:32,980 INFO L87 Difference]: Start difference. First operand 125 states and 135 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-15 13:27:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:33,163 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2023-02-15 13:27:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:33,164 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-15 13:27:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:33,164 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:27:33,165 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:27:33,165 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-15 13:27:33,165 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:33,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 468 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:27:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:27:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2023-02-15 13:27:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 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-15 13:27:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2023-02-15 13:27:33,170 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2023-02-15 13:27:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:33,170 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2023-02-15 13:27:33,171 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-15 13:27:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2023-02-15 13:27:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:27:33,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:33,171 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-15 13:27:33,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:27:33,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash -466517819, now seen corresponding path program 1 times [2023-02-15 13:27:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:33,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449930411] [2023-02-15 13:27:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:33,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:33,430 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-15 13:27:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:33,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449930411] [2023-02-15 13:27:33,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449930411] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:33,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226948132] [2023-02-15 13:27:33,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:33,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:33,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:33,433 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-15 13:27:33,435 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-15 13:27:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:33,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:27:33,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:33,591 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-15 13:27:33,646 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-15 13:27:33,658 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-15 13:27:33,674 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:27:33,675 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-15 13:27:33,730 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-15 13:27:33,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:33,957 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-15 13:27:33,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226948132] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:27:33,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:27:33,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-15 13:27:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151003972] [2023-02-15 13:27:33,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:33,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:27:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:33,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:27:33,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-15 13:27:33,960 INFO L87 Difference]: Start difference. First operand 124 states and 134 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-15 13:27:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:34,264 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2023-02-15 13:27:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:34,264 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-15 13:27:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:34,265 INFO L225 Difference]: With dead ends: 141 [2023-02-15 13:27:34,265 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 13:27:34,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-15 13:27:34,266 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 328 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:34,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 597 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 296 Unchecked, 0.2s Time] [2023-02-15 13:27:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 13:27:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2023-02-15 13:27:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 118 states have internal predecessors, (127), 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-15 13:27:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2023-02-15 13:27:34,270 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 25 [2023-02-15 13:27:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:34,271 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2023-02-15 13:27:34,271 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-15 13:27:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2023-02-15 13:27:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:27:34,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:34,272 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-15 13:27:34,281 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-15 13:27:34,472 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-15 13:27:34,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash -466517818, now seen corresponding path program 1 times [2023-02-15 13:27:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:34,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022254391] [2023-02-15 13:27:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:34,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:27:34,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:34,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022254391] [2023-02-15 13:27:34,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022254391] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:34,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826080203] [2023-02-15 13:27:34,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:34,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:34,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:34,710 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-15 13:27:34,712 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-15 13:27:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:34,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:27:34,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:34,817 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-15 13:27:35,007 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:35,008 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-15 13:27:35,013 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 14 treesize of output 16 [2023-02-15 13:27:35,059 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-15 13:27:35,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:35,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826080203] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:35,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:35,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2023-02-15 13:27:35,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187933523] [2023-02-15 13:27:35,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:35,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:27:35,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:35,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:27:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:27:35,178 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 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-15 13:27:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:35,822 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2023-02-15 13:27:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:27:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 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-15 13:27:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:35,824 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:27:35,824 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 13:27:35,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:27:35,825 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 123 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:35,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 926 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:27:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 13:27:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-02-15 13:27:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 117 states have internal predecessors, (126), 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-15 13:27:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2023-02-15 13:27:35,828 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 25 [2023-02-15 13:27:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:35,828 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2023-02-15 13:27:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 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-15 13:27:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2023-02-15 13:27:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:27:35,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:35,829 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-15 13:27:35,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:36,033 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-15 13:27:36,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:36,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash -342690401, now seen corresponding path program 1 times [2023-02-15 13:27:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:36,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060904179] [2023-02-15 13:27:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:36,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:36,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:36,337 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-15 13:27:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060904179] [2023-02-15 13:27:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060904179] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:36,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532536309] [2023-02-15 13:27:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:36,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:36,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:36,339 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-15 13:27:36,341 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-15 13:27:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:36,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:27:36,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:36,456 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-15 13:27:36,464 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-15 13:27:36,477 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-15 13:27:36,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:36,508 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-15 13:27:36,521 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-15 13:27:36,529 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_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2023-02-15 13:27:36,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:36,563 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-15 13:27:36,579 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-15 13:27:36,607 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:36,607 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-15 13:27:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-15 13:27:36,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:36,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532536309] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:36,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:36,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-15 13:27:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264905091] [2023-02-15 13:27:36,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:36,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:27:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:36,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:27:36,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-15 13:27:36,759 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 13:27:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:36,990 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-02-15 13:27:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:27:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2023-02-15 13:27:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:36,992 INFO L225 Difference]: With dead ends: 131 [2023-02-15 13:27:36,992 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 13:27:36,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-15 13:27:36,993 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 200 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 405 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:36,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 261 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 405 Unchecked, 0.2s Time] [2023-02-15 13:27:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 13:27:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-15 13:27:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 108 states have internal predecessors, (117), 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-15 13:27:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2023-02-15 13:27:36,996 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 37 [2023-02-15 13:27:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:36,996 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2023-02-15 13:27:36,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 13:27:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2023-02-15 13:27:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:27:36,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:36,997 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-15 13:27:37,005 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-15 13:27:37,203 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-15 13:27:37,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash -342690400, now seen corresponding path program 1 times [2023-02-15 13:27:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:37,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686351912] [2023-02-15 13:27:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:27:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:37,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686351912] [2023-02-15 13:27:37,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686351912] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:37,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:37,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:27:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577652478] [2023-02-15 13:27:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:37,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:27:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:27:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:27:37,586 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:27:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:37,835 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2023-02-15 13:27:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:27:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-02-15 13:27:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:37,836 INFO L225 Difference]: With dead ends: 122 [2023-02-15 13:27:37,836 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 13:27:37,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:27:37,836 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 274 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:37,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 227 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:27:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 13:27:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2023-02-15 13:27:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.588235294117647) internal successors, (108), 99 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-15 13:27:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2023-02-15 13:27:37,839 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 37 [2023-02-15 13:27:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:37,840 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2023-02-15 13:27:37,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:27:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2023-02-15 13:27:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:27:37,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:37,841 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-15 13:27:37,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:27:37,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006624, now seen corresponding path program 1 times [2023-02-15 13:27:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:37,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790240703] [2023-02-15 13:27:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:37,941 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-15 13:27:37,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:37,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790240703] [2023-02-15 13:27:37,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790240703] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:37,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:37,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:37,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779807012] [2023-02-15 13:27:37,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:37,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:27:37,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:37,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:27:37,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:27:37,943 INFO L87 Difference]: Start difference. First operand 104 states and 114 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-15 13:27:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:38,067 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2023-02-15 13:27:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:38,068 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-15 13:27:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:38,068 INFO L225 Difference]: With dead ends: 120 [2023-02-15 13:27:38,068 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 13:27:38,069 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-15 13:27:38,069 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 84 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:38,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 308 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:27:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 13:27:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2023-02-15 13:27:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 97 states have internal predecessors, (106), 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-15 13:27:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2023-02-15 13:27:38,071 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 39 [2023-02-15 13:27:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:38,071 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2023-02-15 13:27:38,072 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-15 13:27:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2023-02-15 13:27:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:27:38,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:38,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, 1, 1] [2023-02-15 13:27:38,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:27:38,072 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006625, now seen corresponding path program 1 times [2023-02-15 13:27:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:38,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337316201] [2023-02-15 13:27:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,216 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-15 13:27:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:38,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337316201] [2023-02-15 13:27:38,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337316201] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:38,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:38,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603232146] [2023-02-15 13:27:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:38,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:27:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:38,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:27:38,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:27:38,218 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 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-15 13:27:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:38,342 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2023-02-15 13:27:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 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-15 13:27:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:38,343 INFO L225 Difference]: With dead ends: 100 [2023-02-15 13:27:38,343 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 13:27:38,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-15 13:27:38,344 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 85 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:38,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 319 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:27:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 13:27:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-15 13:27:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 95 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-15 13:27:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2023-02-15 13:27:38,346 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 39 [2023-02-15 13:27:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:38,346 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2023-02-15 13:27:38,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 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-15 13:27:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2023-02-15 13:27:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:27:38,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:38,346 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-15 13:27:38,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:27:38,347 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750501, now seen corresponding path program 1 times [2023-02-15 13:27:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:38,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364354223] [2023-02-15 13:27:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,770 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-15 13:27:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:38,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364354223] [2023-02-15 13:27:38,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364354223] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:38,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889669269] [2023-02-15 13:27:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:38,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:38,772 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-15 13:27:38,773 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-15 13:27:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 13:27:38,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:39,040 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-15 13:27:39,114 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_978 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_978))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 13:27:39,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:39,133 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-15 13:27:39,141 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 13:27:39,142 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-15 13:27:39,193 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-15 13:27:39,203 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-15 13:27:39,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:27:39,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889669269] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:39,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:27:39,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-15 13:27:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721921422] [2023-02-15 13:27:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:39,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:27:39,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:27:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-15 13:27:39,207 INFO L87 Difference]: Start difference. First operand 100 states and 110 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-15 13:27:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:39,625 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2023-02-15 13:27:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 13:27:39,626 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-15 13:27:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:39,627 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:27:39,627 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:27:39,627 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-15 13:27:39,627 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 95 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:39,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 849 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 700 Invalid, 3 Unknown, 147 Unchecked, 0.3s Time] [2023-02-15 13:27:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:27:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2023-02-15 13:27:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5072463768115942) 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-15 13:27:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-02-15 13:27:39,630 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 41 [2023-02-15 13:27:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:39,630 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-02-15 13:27:39,630 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-15 13:27:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-02-15 13:27:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:27:39,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:39,631 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-15 13:27:39,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:39,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:39,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750502, now seen corresponding path program 1 times [2023-02-15 13:27:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:39,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289203602] [2023-02-15 13:27:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:40,616 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-15 13:27:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:40,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289203602] [2023-02-15 13:27:40,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289203602] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:40,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752862781] [2023-02-15 13:27:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:40,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:40,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:40,619 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-15 13:27:40,621 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-15 13:27:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:40,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-15 13:27:40,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:40,791 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-15 13:27:41,075 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-15 13:27:41,078 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-15 13:27:41,182 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1137) |c_#memory_$Pointer$.offset|) (<= (+ |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_1138)) (= (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-15 13:27:41,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:41,210 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 21 treesize of output 21 [2023-02-15 13:27:41,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:41,214 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-15 13:27:41,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:41,218 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 18 treesize of output 13 [2023-02-15 13:27:41,224 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:27:41,224 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-15 13:27:41,267 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-15 13:27:41,271 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 22 treesize of output 10 [2023-02-15 13:27:41,317 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-15 13:27:41,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:42,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752862781] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:42,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:42,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-15 13:27:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4516446] [2023-02-15 13:27:42,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:42,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 13:27:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:42,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 13:27:42,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2023-02-15 13:27:42,028 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 13:27:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:43,578 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2023-02-15 13:27:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:27:43,578 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 13:27:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:43,579 INFO L225 Difference]: With dead ends: 166 [2023-02-15 13:27:43,579 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 13:27:43,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2023-02-15 13:27:43,581 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 389 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:43,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1680 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1914 Invalid, 0 Unknown, 175 Unchecked, 1.0s Time] [2023-02-15 13:27:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 13:27:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 103. [2023-02-15 13:27:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 98 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-15 13:27:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2023-02-15 13:27:43,600 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 41 [2023-02-15 13:27:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:43,600 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2023-02-15 13:27:43,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 13:27:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2023-02-15 13:27:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:27:43,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:43,601 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-15 13:27:43,611 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-15 13:27:43,808 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,SelfDestructingSolverStorable12 [2023-02-15 13:27:43,809 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116815, now seen corresponding path program 1 times [2023-02-15 13:27:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:43,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824973620] [2023-02-15 13:27:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:44,020 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-15 13:27:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:44,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824973620] [2023-02-15 13:27:44,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824973620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:44,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:44,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:27:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434865126] [2023-02-15 13:27:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:44,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:27:44,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:27:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:27:44,024 INFO L87 Difference]: Start difference. First operand 103 states and 114 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-15 13:27:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:44,257 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2023-02-15 13:27:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:27:44,257 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 46 [2023-02-15 13:27:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:44,258 INFO L225 Difference]: With dead ends: 176 [2023-02-15 13:27:44,258 INFO L226 Difference]: Without dead ends: 176 [2023-02-15 13:27:44,259 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-15 13:27:44,259 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 429 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:44,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 447 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:27:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-15 13:27:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 108. [2023-02-15 13:27:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 103 states have internal predecessors, (114), 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-15 13:27:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2023-02-15 13:27:44,261 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 46 [2023-02-15 13:27:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:44,261 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-02-15 13:27:44,262 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-15 13:27:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2023-02-15 13:27:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:27:44,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:44,262 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-15 13:27:44,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:27:44,262 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116814, now seen corresponding path program 1 times [2023-02-15 13:27:44,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:44,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403171582] [2023-02-15 13:27:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:44,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:44,585 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-15 13:27:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:44,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403171582] [2023-02-15 13:27:44,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403171582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:44,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:44,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:27:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570247805] [2023-02-15 13:27:44,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:44,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:27:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:44,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:27:44,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:27:44,588 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-15 13:27:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:44,812 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2023-02-15 13:27:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:27:44,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 46 [2023-02-15 13:27:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:44,813 INFO L225 Difference]: With dead ends: 204 [2023-02-15 13:27:44,813 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 13:27:44,813 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-15 13:27:44,814 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 348 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:44,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 479 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:27:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 13:27:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 111. [2023-02-15 13:27:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 106 states have internal predecessors, (117), 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-15 13:27:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2023-02-15 13:27:44,816 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 46 [2023-02-15 13:27:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:44,816 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2023-02-15 13:27:44,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-15 13:27:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2023-02-15 13:27:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:27:44,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:44,817 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-15 13:27:44,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:27:44,817 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash 241903816, now seen corresponding path program 1 times [2023-02-15 13:27:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:44,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245433147] [2023-02-15 13:27:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:45,754 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-15 13:27:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:45,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245433147] [2023-02-15 13:27:45,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245433147] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:45,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003879659] [2023-02-15 13:27:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:45,757 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-15 13:27:45,759 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-15 13:27:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:45,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-15 13:27:45,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:45,933 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-15 13:27:46,080 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:46,081 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-15 13:27:46,153 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-15 13:27:46,254 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:46,254 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-15 13:27:46,381 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:46,381 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-15 13:27:46,389 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-15 13:27:46,399 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-15 13:27:46,504 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1531)) (<= (+ |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|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1532) |c_#memory_$Pointer$.offset|))) is different from true [2023-02-15 13:27:46,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:46,531 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-15 13:27:46,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:46,542 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:46,542 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-15 13:27:46,565 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-02-15 13:27:46,565 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-15 13:27:46,623 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-15 13:27:46,731 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:46,731 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-15 13:27:46,798 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-15 13:27:46,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:46,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003879659] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:46,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:46,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2023-02-15 13:27:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199652341] [2023-02-15 13:27:46,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:46,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:27:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:27:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1924, Unknown=1, NotChecked=88, Total=2162 [2023-02-15 13:27:46,911 INFO L87 Difference]: Start difference. First operand 111 states and 123 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-15 13:27:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:48,915 INFO L93 Difference]: Finished difference Result 255 states and 286 transitions. [2023-02-15 13:27:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:27:48,916 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-15 13:27:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:48,917 INFO L225 Difference]: With dead ends: 255 [2023-02-15 13:27:48,917 INFO L226 Difference]: Without dead ends: 255 [2023-02-15 13:27:48,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=407, Invalid=3628, Unknown=1, NotChecked=124, Total=4160 [2023-02-15 13:27:48,919 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 619 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:48,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2185 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2296 Invalid, 0 Unknown, 145 Unchecked, 1.1s Time] [2023-02-15 13:27:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-02-15 13:27:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 131. [2023-02-15 13:27:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 100 states have (on average 1.39) internal successors, (139), 124 states have internal predecessors, (139), 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-15 13:27:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2023-02-15 13:27:48,922 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 46 [2023-02-15 13:27:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:48,923 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2023-02-15 13:27:48,923 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-15 13:27:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2023-02-15 13:27:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:27:48,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:48,924 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-15 13:27:48,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 13:27:49,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 13:27:49,130 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 241903817, now seen corresponding path program 1 times [2023-02-15 13:27:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:49,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461718835] [2023-02-15 13:27:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:50,478 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-15 13:27:50,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461718835] [2023-02-15 13:27:50,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461718835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218619069] [2023-02-15 13:27:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:50,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:50,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:50,480 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-15 13:27:50,481 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-15 13:27:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:50,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 120 conjunts are in the unsatisfiable core [2023-02-15 13:27:50,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:50,660 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-15 13:27:50,892 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:50,893 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-15 13:27:50,984 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-15 13:27:50,989 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-15 13:27:51,118 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:51,119 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-15 13:27:51,126 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-15 13:27:51,304 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:51,305 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-15 13:27:51,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:27:51,461 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1705 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1705) |c_#length|)) (exists ((v_ArrVal_1708 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1708) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1709 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1709) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:27:51,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:51,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:51,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:51,490 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-15 13:27:51,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:51,500 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:51,500 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-15 13:27:51,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:51,505 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 20 treesize of output 22 [2023-02-15 13:27:51,516 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:27:51,517 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-15 13:27:51,791 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 13:27:51,793 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-15 13:27:51,798 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:27:51,799 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-15 13:27:51,867 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-15 13:27:51,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:52,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218619069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:52,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:52,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 54 [2023-02-15 13:27:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086510647] [2023-02-15 13:27:52,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:52,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-15 13:27:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-15 13:27:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3458, Unknown=2, NotChecked=118, Total=3782 [2023-02-15 13:27:52,342 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 55 states, 50 states have (on average 1.58) internal successors, (79), 48 states have internal predecessors, (79), 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-15 13:27:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:55,943 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2023-02-15 13:27:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 13:27:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 50 states have (on average 1.58) internal successors, (79), 48 states have internal predecessors, (79), 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-15 13:27:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:55,945 INFO L225 Difference]: With dead ends: 267 [2023-02-15 13:27:55,945 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 13:27:55,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=475, Invalid=6333, Unknown=2, NotChecked=162, Total=6972 [2023-02-15 13:27:55,946 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 361 mSDsluCounter, 4374 mSDsCounter, 0 mSdLazyCounter, 4990 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 5151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:55,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 4522 Invalid, 5151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4990 Invalid, 0 Unknown, 140 Unchecked, 2.1s Time] [2023-02-15 13:27:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 13:27:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 130. [2023-02-15 13:27:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 123 states have internal predecessors, (137), 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-15 13:27:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2023-02-15 13:27:55,950 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 46 [2023-02-15 13:27:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:55,950 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2023-02-15 13:27:55,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 50 states have (on average 1.58) internal successors, (79), 48 states have internal predecessors, (79), 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-15 13:27:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2023-02-15 13:27:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:27:55,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:55,951 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] [2023-02-15 13:27:55,958 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-15 13:27:56,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:56,157 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash 185060511, now seen corresponding path program 1 times [2023-02-15 13:27:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:56,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881866817] [2023-02-15 13:27:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:27:56,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:56,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881866817] [2023-02-15 13:27:56,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881866817] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:56,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:56,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:27:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545014473] [2023-02-15 13:27:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:56,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:27:56,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:56,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:27:56,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:27:56,245 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:27:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:56,379 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2023-02-15 13:27:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:27:56,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-15 13:27:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:56,380 INFO L225 Difference]: With dead ends: 173 [2023-02-15 13:27:56,380 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 13:27:56,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:27:56,381 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 155 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:56,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 414 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:27:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 13:27:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 130. [2023-02-15 13:27:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 100 states have (on average 1.38) internal successors, (138), 123 states have internal predecessors, (138), 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-15 13:27:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2023-02-15 13:27:56,384 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 49 [2023-02-15 13:27:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:56,384 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2023-02-15 13:27:56,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:27:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2023-02-15 13:27:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:27:56,384 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:56,384 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] [2023-02-15 13:27:56,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:27:56,384 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash 185060512, now seen corresponding path program 1 times [2023-02-15 13:27:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:56,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045559162] [2023-02-15 13:27:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,737 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-15 13:27:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:56,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045559162] [2023-02-15 13:27:56,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045559162] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:56,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:56,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 13:27:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914986360] [2023-02-15 13:27:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:56,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:27:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:56,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:27:56,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:27:56,741 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-15 13:27:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:57,084 INFO L93 Difference]: Finished difference Result 191 states and 215 transitions. [2023-02-15 13:27:57,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:27:57,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 49 [2023-02-15 13:27:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:57,085 INFO L225 Difference]: With dead ends: 191 [2023-02-15 13:27:57,085 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 13:27:57,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-02-15 13:27:57,086 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 254 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:57,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 587 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:27:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 13:27:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 138. [2023-02-15 13:27:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 131 states have internal predecessors, (151), 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-15 13:27:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2023-02-15 13:27:57,089 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 49 [2023-02-15 13:27:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:57,089 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2023-02-15 13:27:57,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-15 13:27:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2023-02-15 13:27:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:27:57,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:57,091 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-15 13:27:57,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:27:57,091 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:57,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1749494887, now seen corresponding path program 1 times [2023-02-15 13:27:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:57,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321194275] [2023-02-15 13:27:57,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:57,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:57,431 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-15 13:27:57,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:57,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321194275] [2023-02-15 13:27:57,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321194275] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:57,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446336485] [2023-02-15 13:27:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:57,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:57,433 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-15 13:27:57,435 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-15 13:27:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:57,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 13:27:57,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:57,742 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 8 treesize of output 4 [2023-02-15 13:27:57,782 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2120 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2120)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:27:57,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:57,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 13:27:57,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 13:27:57,825 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-15 13:27:57,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:57,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446336485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:57,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:57,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 13:27:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61330084] [2023-02-15 13:27:57,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:57,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 13:27:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:57,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 13:27:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=611, Unknown=8, NotChecked=50, Total=756 [2023-02-15 13:27:57,893 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 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-15 13:27:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:58,261 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2023-02-15 13:27:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:27:58,262 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 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 51 [2023-02-15 13:27:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:58,262 INFO L225 Difference]: With dead ends: 119 [2023-02-15 13:27:58,262 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 13:27:58,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=1010, Unknown=8, NotChecked=66, Total=1260 [2023-02-15 13:27:58,263 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 387 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:58,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 724 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 483 Invalid, 0 Unknown, 103 Unchecked, 0.2s Time] [2023-02-15 13:27:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 13:27:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-15 13:27:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.3932584269662922) 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-15 13:27:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2023-02-15 13:27:58,266 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 51 [2023-02-15 13:27:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:58,266 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2023-02-15 13:27:58,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 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-15 13:27:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2023-02-15 13:27:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:27:58,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:58,267 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-15 13:27:58,276 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-15 13:27:58,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:58,472 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:27:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash -720045115, now seen corresponding path program 2 times [2023-02-15 13:27:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:58,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341593338] [2023-02-15 13:27:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,551 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-15 13:27:59,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:59,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341593338] [2023-02-15 13:27:59,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341593338] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:59,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078764671] [2023-02-15 13:27:59,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:27:59,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:59,553 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-15 13:27:59,554 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-15 13:27:59,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:27:59,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:27:59,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-15 13:27:59,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:59,744 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-15 13:27:59,854 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:59,855 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-15 13:28:00,023 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-15 13:28:00,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 13:28:00,136 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-15 13:28:00,141 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-15 13:28:00,281 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:28:00,282 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 33 [2023-02-15 13:28:00,289 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-15 13:28:00,577 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2291 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2291) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2292 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2292) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:28:00,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:00,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:00,594 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-15 13:28:00,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:00,611 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 13:28:00,611 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 75 treesize of output 69 [2023-02-15 13:28:00,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:00,628 INFO L321 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2023-02-15 13:28:00,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 13:28:00,994 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:00,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:00,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:00,999 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:28:00,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2023-02-15 13:28:01,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:01,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:01,223 INFO L321 Elim1Store]: treesize reduction 102, result has 12.1 percent of original size [2023-02-15 13:28:01,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 60 treesize of output 41 [2023-02-15 13:28:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 13:28:01,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:01,413 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-02-15 13:28:01,414 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 24 treesize of output 23 [2023-02-15 13:28:01,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078764671] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:01,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:01,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 56 [2023-02-15 13:28:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974955873] [2023-02-15 13:28:01,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:01,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 13:28:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 13:28:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3713, Unknown=5, NotChecked=122, Total=4032 [2023-02-15 13:28:01,710 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 49 states have internal predecessors, (89), 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-15 13:28:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:06,614 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2023-02-15 13:28:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:28:06,614 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 49 states have internal predecessors, (89), 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 51 [2023-02-15 13:28:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:06,615 INFO L225 Difference]: With dead ends: 145 [2023-02-15 13:28:06,615 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 13:28:06,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=596, Invalid=6543, Unknown=5, NotChecked=166, Total=7310 [2023-02-15 13:28:06,617 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 471 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:06,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1794 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2395 Invalid, 0 Unknown, 131 Unchecked, 1.3s Time] [2023-02-15 13:28:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 13:28:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 122. [2023-02-15 13:28:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 115 states have internal predecessors, (127), 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-15 13:28:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2023-02-15 13:28:06,620 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 51 [2023-02-15 13:28:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:06,620 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2023-02-15 13:28:06,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 49 states have internal predecessors, (89), 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-15 13:28:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2023-02-15 13:28:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:28:06,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:06,621 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-15 13:28:06,633 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-15 13:28:06,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:06,827 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:28:06,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536311, now seen corresponding path program 1 times [2023-02-15 13:28:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:06,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994472114] [2023-02-15 13:28:06,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:07,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:07,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994472114] [2023-02-15 13:28:07,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994472114] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:07,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183023626] [2023-02-15 13:28:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:07,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:07,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:07,455 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-15 13:28:07,456 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-15 13:28:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:07,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 13:28:07,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:07,901 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-15 13:28:07,903 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-15 13:28:08,113 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 13:28:08,114 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 21 treesize of output 29 [2023-02-15 13:28:08,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:08,118 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 33 treesize of output 31 [2023-02-15 13:28:08,376 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:08,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2023-02-15 13:28:08,450 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:08,451 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 50 treesize of output 46 [2023-02-15 13:28:08,506 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-15 13:28:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:08,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:28:08,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183023626] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:28:08,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [23] total 41 [2023-02-15 13:28:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883274654] [2023-02-15 13:28:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:08,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 13:28:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 13:28:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1598, Unknown=1, NotChecked=0, Total=1722 [2023-02-15 13:28:08,513 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:28:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:09,536 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2023-02-15 13:28:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 13:28:09,536 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2023-02-15 13:28:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:09,537 INFO L225 Difference]: With dead ends: 201 [2023-02-15 13:28:09,537 INFO L226 Difference]: Without dead ends: 201 [2023-02-15 13:28:09,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=307, Invalid=2662, Unknown=1, NotChecked=0, Total=2970 [2023-02-15 13:28:09,538 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 944 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 18 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:09,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 521 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 768 Invalid, 4 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:28:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-02-15 13:28:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 132. [2023-02-15 13:28:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 125 states have internal predecessors, (138), 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-15 13:28:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2023-02-15 13:28:09,541 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 53 [2023-02-15 13:28:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:09,541 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2023-02-15 13:28:09,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:28:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2023-02-15 13:28:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:28:09,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:09,542 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-15 13:28:09,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:09,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 13:28:09,748 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:28:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536312, now seen corresponding path program 1 times [2023-02-15 13:28:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997329842] [2023-02-15 13:28:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:10,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:10,492 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-15 13:28:10,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:10,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997329842] [2023-02-15 13:28:10,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997329842] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:10,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199929769] [2023-02-15 13:28:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:10,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:10,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:10,493 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-15 13:28:10,495 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-15 13:28:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:10,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 13:28:10,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:10,919 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-15 13:28:10,961 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2662 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2662) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 13:28:10,965 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2663 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2663)))) is different from true [2023-02-15 13:28:11,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:11,013 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-15 13:28:11,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:11,229 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 45 treesize of output 44 [2023-02-15 13:28:11,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:11,233 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 33 treesize of output 33 [2023-02-15 13:28:11,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:11,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-15 13:28:11,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:11,282 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 29 treesize of output 29 [2023-02-15 13:28:11,348 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-15 13:28:11,350 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-15 13:28:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-15 13:28:11,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:11,457 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2666 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2666) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2666) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2667) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:28:11,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:11,597 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 50 treesize of output 54 [2023-02-15 13:28:11,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:11,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 240 [2023-02-15 13:28:11,869 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 224 treesize of output 222 [2023-02-15 13:28:11,872 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 222 treesize of output 218 [2023-02-15 13:28:11,876 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 218 treesize of output 210 [2023-02-15 13:28:11,882 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 210 treesize of output 206 [2023-02-15 13:28:12,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199929769] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:12,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:12,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 48 [2023-02-15 13:28:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184118221] [2023-02-15 13:28:12,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:12,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 13:28:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 13:28:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2673, Unknown=37, NotChecked=318, Total=3192 [2023-02-15 13:28:12,175 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:28:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:15,000 INFO L93 Difference]: Finished difference Result 181 states and 203 transitions. [2023-02-15 13:28:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 13:28:15,005 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2023-02-15 13:28:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:15,006 INFO L225 Difference]: With dead ends: 181 [2023-02-15 13:28:15,006 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 13:28:15,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=711, Invalid=6742, Unknown=41, NotChecked=516, Total=8010 [2023-02-15 13:28:15,008 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 800 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 2851 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 371 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:15,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2101 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2851 Invalid, 0 Unknown, 371 Unchecked, 1.2s Time] [2023-02-15 13:28:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 13:28:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 131. [2023-02-15 13:28:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 124 states have internal predecessors, (135), 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-15 13:28:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2023-02-15 13:28:15,013 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 53 [2023-02-15 13:28:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:15,013 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2023-02-15 13:28:15,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:28:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2023-02-15 13:28:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:28:15,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:15,014 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-15 13:28:15,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-15 13:28:15,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-15 13:28:15,220 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:28:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1984271002, now seen corresponding path program 3 times [2023-02-15 13:28:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:15,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494599844] [2023-02-15 13:28:15,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:15,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:15,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 13:28:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 13:28:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:15,289 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-15 13:28:15,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494599844] [2023-02-15 13:28:15,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494599844] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128030831] [2023-02-15 13:28:15,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:28:15,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:15,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:15,291 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-15 13:28:15,293 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-15 13:28:15,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 13:28:15,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:28:15,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:28:15,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:15,564 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-15 13:28:15,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:28:15,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128030831] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:15,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:28:15,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 13:28:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195755923] [2023-02-15 13:28:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:15,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:28:15,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:28:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:28:15,566 INFO L87 Difference]: Start difference. First operand 131 states and 145 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-15 13:28:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:15,575 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2023-02-15 13:28:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:28:15,575 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-15 13:28:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:15,576 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:28:15,576 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 13:28:15,576 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-15 13:28:15,577 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 156 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 107 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-15 13:28:15,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:28:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 13:28:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-15 13:28:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 88 states have internal predecessors, (95), 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-15 13:28:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-02-15 13:28:15,582 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 58 [2023-02-15 13:28:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:15,582 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-02-15 13:28:15,582 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-15 13:28:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-02-15 13:28:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:28:15,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:15,583 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-15 13:28:15,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:15,789 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,SelfDestructingSolverStorable23 [2023-02-15 13:28:15,790 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:28:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1012998182, now seen corresponding path program 1 times [2023-02-15 13:28:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:15,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625952853] [2023-02-15 13:28:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,012 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-15 13:28:17,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:17,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625952853] [2023-02-15 13:28:17,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625952853] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:17,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962723379] [2023-02-15 13:28:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:17,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:17,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:17,013 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-15 13:28:17,014 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-15 13:28:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-15 13:28:17,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:17,563 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-15 13:28:17,566 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-15 13:28:17,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:17,845 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 21 treesize of output 21 [2023-02-15 13:28:17,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:17,852 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-15 13:28:17,863 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 13:28:17,863 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 21 treesize of output 29 [2023-02-15 13:28:18,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:18,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2023-02-15 13:28:18,465 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:28:18,465 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 29 treesize of output 32 [2023-02-15 13:28:18,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:18,613 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 13:28:18,614 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 53 treesize of output 58 [2023-02-15 13:28:18,633 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-15 13:28:18,778 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 69 treesize of output 45 [2023-02-15 13:28:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:18,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:18,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3065 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3065) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 13:28:25,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962723379] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:25,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:25,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25] total 57 [2023-02-15 13:28:25,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119342073] [2023-02-15 13:28:25,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:25,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 13:28:25,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:25,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 13:28:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=4128, Unknown=30, NotChecked=130, Total=4556 [2023-02-15 13:28:25,666 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 58 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 51 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:28:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:29,080 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2023-02-15 13:28:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 13:28:29,081 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 51 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 58 [2023-02-15 13:28:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:29,081 INFO L225 Difference]: With dead ends: 113 [2023-02-15 13:28:29,081 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 13:28:29,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=835, Invalid=7509, Unknown=32, NotChecked=180, Total=8556 [2023-02-15 13:28:29,082 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 901 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:29,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1330 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2206 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:28:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 13:28:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2023-02-15 13:28:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 89 states have internal predecessors, (97), 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-15 13:28:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2023-02-15 13:28:29,085 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 58 [2023-02-15 13:28:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:29,085 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2023-02-15 13:28:29,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 51 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:28:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2023-02-15 13:28:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:28:29,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:29,086 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-15 13:28:29,096 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-15 13:28:29,292 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,SelfDestructingSolverStorable24 [2023-02-15 13:28:29,292 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-02-15 13:28:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1012998181, now seen corresponding path program 1 times [2023-02-15 13:28:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269975575] [2023-02-15 13:28:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:30,798 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-15 13:28:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269975575] [2023-02-15 13:28:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269975575] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530758817] [2023-02-15 13:28:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:30,800 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-15 13:28:30,801 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-15 13:28:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:31,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-15 13:28:31,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:31,025 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-15 13:28:31,066 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-15 13:28:31,100 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_3254 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3254))))) is different from true [2023-02-15 13:28:31,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:31,119 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-15 13:28:31,131 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-15 13:28:31,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:31,244 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-15 13:28:31,516 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-15 13:28:31,518 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-15 13:28:31,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:31,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:31,834 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-15 13:28:31,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:31,843 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-15 13:28:32,384 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:28:32,385 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 34 treesize of output 29 [2023-02-15 13:28:32,401 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 13:28:32,402 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 27 treesize of output 30 [2023-02-15 13:28:32,606 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 13:28:32,606 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 60 treesize of output 66 [2023-02-15 13:28:32,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:32,620 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 13:28:32,621 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 58 treesize of output 63 [2023-02-15 13:28:32,634 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 22 treesize of output 16 [2023-02-15 13:28:32,658 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 48 treesize of output 38 [2023-02-15 13:28:32,889 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 23 treesize of output 15 [2023-02-15 13:28:32,892 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-15 13:28:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-15 13:28:33,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:58,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:58,606 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 2928 treesize of output 2918 [2023-02-15 13:28:58,618 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 2846 treesize of output 2782 [2023-02-15 13:28:58,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:58,638 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 3070 treesize of output 3044