./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/forester-heap/dll-sorted-2.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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:31:58,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:31:58,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:31:58,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:31:58,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:31:58,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:31:58,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:31:58,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:31:58,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:31:58,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:31:58,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:31:58,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:31:58,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:31:58,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:31:58,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:31:58,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:31:58,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:31:58,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:31:58,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:31:58,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:31:58,206 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:31:58,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:31:58,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:31:58,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:31:58,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:31:58,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:31:58,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:31:58,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:31:58,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:31:58,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:31:58,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:31:58,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:31:58,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:31:58,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:31:58,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:31:58,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:31:58,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:31:58,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:31:58,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:31:58,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:31:58,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:31:58,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:31:58,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:31:58,256 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:31:58,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:31:58,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:31:58,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:31:58,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:31:58,257 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:31:58,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:31:58,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:31:58,258 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:31:58,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:31:58,259 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:31:58,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:31:58,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:31:58,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:31:58,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:31:58,259 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:31:58,260 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:31:58,260 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:31:58,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:31:58,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:31:58,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:31:58,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:31:58,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:31:58,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:31:58,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:31:58,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:31:58,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:31:58,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:31:58,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:31:58,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:31:58,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2022-07-21 17:31:58,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:31:58,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:31:58,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:31:58,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:31:58,607 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:31:58,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-07-21 17:31:58,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2802289/3adffa3d752c4dde8386ca27a1fc599d/FLAGf2c9f509f [2022-07-21 17:31:59,129 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:31:59,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-07-21 17:31:59,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2802289/3adffa3d752c4dde8386ca27a1fc599d/FLAGf2c9f509f [2022-07-21 17:31:59,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2802289/3adffa3d752c4dde8386ca27a1fc599d [2022-07-21 17:31:59,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:31:59,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:31:59,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:31:59,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:31:59,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:31:59,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:31:59" (1/1) ... [2022-07-21 17:31:59,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7697607b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:59, skipping insertion in model container [2022-07-21 17:31:59,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:31:59" (1/1) ... [2022-07-21 17:31:59,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:31:59,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:31:59,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-07-21 17:31:59,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-07-21 17:31:59,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-07-21 17:31:59,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-07-21 17:31:59,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-07-21 17:31:59,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-07-21 17:31:59,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:31:59,975 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:32:00,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-07-21 17:32:00,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-07-21 17:32:00,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-07-21 17:32:00,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-07-21 17:32:00,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-07-21 17:32:00,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-07-21 17:32:00,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:32:00,039 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:32:00,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00 WrapperNode [2022-07-21 17:32:00,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:32:00,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:32:00,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:32:00,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:32:00,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,086 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2022-07-21 17:32:00,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:32:00,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:32:00,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:32:00,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:32:00,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:32:00,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:32:00,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:32:00,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:32:00,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (1/1) ... [2022-07-21 17:32:00,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:32:00,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:32:00,196 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) [2022-07-21 17:32:00,203 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 [2022-07-21 17:32:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:32:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:32:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:32:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:32:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:32:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:32:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:32:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:32:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:32:00,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:32:00,351 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:32:00,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:32:00,788 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:32:00,797 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:32:00,798 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-07-21 17:32:00,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:32:00 BoogieIcfgContainer [2022-07-21 17:32:00,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:32:00,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:32:00,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:32:00,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:32:00,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:31:59" (1/3) ... [2022-07-21 17:32:00,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0a2099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:32:00, skipping insertion in model container [2022-07-21 17:32:00,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:32:00" (2/3) ... [2022-07-21 17:32:00,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0a2099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:32:00, skipping insertion in model container [2022-07-21 17:32:00,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:32:00" (3/3) ... [2022-07-21 17:32:00,808 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-07-21 17:32:00,821 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:32:00,821 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-07-21 17:32:00,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:32:00,872 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@482126cb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ea9e47f [2022-07-21 17:32:00,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-07-21 17:32:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:32:00,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:00,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:32:00,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:32:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:00,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299937767] [2022-07-21 17:32:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:01,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:01,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299937767] [2022-07-21 17:32:01,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299937767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:01,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:01,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:32:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290815715] [2022-07-21 17:32:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:01,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:32:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:32:01,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:32:01,083 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:01,250 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-07-21 17:32:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:32:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:32:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:01,263 INFO L225 Difference]: With dead ends: 182 [2022-07-21 17:32:01,263 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 17:32:01,265 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 [2022-07-21 17:32:01,267 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:01,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:32:01,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 17:32:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2022-07-21 17:32:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2022-07-21 17:32:01,319 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2022-07-21 17:32:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:01,320 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2022-07-21 17:32:01,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2022-07-21 17:32:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:32:01,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:01,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:32:01,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:32:01,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:32:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:01,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622713242] [2022-07-21 17:32:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:01,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622713242] [2022-07-21 17:32:01,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622713242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:01,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:01,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:32:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864216149] [2022-07-21 17:32:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:01,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:32:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:32:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:32:01,392 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:01,497 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-07-21 17:32:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:32:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:32:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:01,499 INFO L225 Difference]: With dead ends: 175 [2022-07-21 17:32:01,499 INFO L226 Difference]: Without dead ends: 175 [2022-07-21 17:32:01,499 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 [2022-07-21 17:32:01,500 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:01,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:32:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-21 17:32:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-07-21 17:32:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-07-21 17:32:01,508 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2022-07-21 17:32:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:01,508 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-07-21 17:32:01,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-07-21 17:32:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 17:32:01,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:01,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:01,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:32:01,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-07-21 17:32:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:01,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132489235] [2022-07-21 17:32:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:01,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132489235] [2022-07-21 17:32:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132489235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:01,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:01,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:32:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456604247] [2022-07-21 17:32:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:01,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:32:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:32:01,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:32:01,598 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:01,776 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-07-21 17:32:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:32:01,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 17:32:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:01,779 INFO L225 Difference]: With dead ends: 178 [2022-07-21 17:32:01,779 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 17:32:01,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:32:01,782 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 294 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:01,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 89 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:32:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 17:32:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-07-21 17:32:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-07-21 17:32:01,805 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2022-07-21 17:32:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:01,805 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-07-21 17:32:01,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-07-21 17:32:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 17:32:01,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:01,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:01,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:32:01,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:01,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-07-21 17:32:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247314102] [2022-07-21 17:32:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:01,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247314102] [2022-07-21 17:32:01,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247314102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:01,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:01,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:32:01,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732157349] [2022-07-21 17:32:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:01,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:32:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:32:01,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:32:01,907 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:02,201 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-07-21 17:32:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:32:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 17:32:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:02,202 INFO L225 Difference]: With dead ends: 258 [2022-07-21 17:32:02,203 INFO L226 Difference]: Without dead ends: 258 [2022-07-21 17:32:02,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:32:02,204 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 437 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:02,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 130 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:32:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-21 17:32:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2022-07-21 17:32:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2022-07-21 17:32:02,215 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2022-07-21 17:32:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:02,215 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2022-07-21 17:32:02,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2022-07-21 17:32:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:32:02,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:02,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:02,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:32:02,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2022-07-21 17:32:02,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:02,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251059228] [2022-07-21 17:32:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:02,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:02,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251059228] [2022-07-21 17:32:02,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251059228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:02,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:02,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:32:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918872334] [2022-07-21 17:32:02,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:02,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:32:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:02,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:32:02,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:32:02,251 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:02,268 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-07-21 17:32:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:32:02,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 17:32:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:02,271 INFO L225 Difference]: With dead ends: 266 [2022-07-21 17:32:02,271 INFO L226 Difference]: Without dead ends: 266 [2022-07-21 17:32:02,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:32:02,272 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:02,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:32:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-21 17:32:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2022-07-21 17:32:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2022-07-21 17:32:02,277 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2022-07-21 17:32:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:02,278 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2022-07-21 17:32:02,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2022-07-21 17:32:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:32:02,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:02,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:02,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:32:02,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-21 17:32:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:02,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233777609] [2022-07-21 17:32:02,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:02,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:02,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233777609] [2022-07-21 17:32:02,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233777609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:02,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:02,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:32:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293312439] [2022-07-21 17:32:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:02,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:32:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:32:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:32:02,397 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:02,601 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-07-21 17:32:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:32:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 17:32:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:02,602 INFO L225 Difference]: With dead ends: 232 [2022-07-21 17:32:02,602 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 17:32:02,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:32:02,604 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:02,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:32:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 17:32:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-21 17:32:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2022-07-21 17:32:02,608 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2022-07-21 17:32:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:02,609 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2022-07-21 17:32:02,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-07-21 17:32:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:32:02,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:02,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:02,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:32:02,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-21 17:32:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:02,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588502499] [2022-07-21 17:32:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:02,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588502499] [2022-07-21 17:32:02,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588502499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:02,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:02,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:32:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178326744] [2022-07-21 17:32:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:02,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:32:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:32:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:32:02,655 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:02,819 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-07-21 17:32:02,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:32:02,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 17:32:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:02,821 INFO L225 Difference]: With dead ends: 231 [2022-07-21 17:32:02,821 INFO L226 Difference]: Without dead ends: 231 [2022-07-21 17:32:02,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:32:02,823 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:02,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 426 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:32:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-21 17:32:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-21 17:32:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2022-07-21 17:32:02,829 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2022-07-21 17:32:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:02,830 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2022-07-21 17:32:02,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-07-21 17:32:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:32:02,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:02,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:02,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:32:02,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-21 17:32:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:02,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889668266] [2022-07-21 17:32:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:02,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889668266] [2022-07-21 17:32:02,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889668266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:02,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:02,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:32:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056439614] [2022-07-21 17:32:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:02,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:32:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:32:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:32:02,956 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:03,249 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-07-21 17:32:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:32:03,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:32:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:03,251 INFO L225 Difference]: With dead ends: 237 [2022-07-21 17:32:03,251 INFO L226 Difference]: Without dead ends: 237 [2022-07-21 17:32:03,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:32:03,252 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 291 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:03,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 289 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:32:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-21 17:32:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-07-21 17:32:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-07-21 17:32:03,260 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2022-07-21 17:32:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:03,261 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-07-21 17:32:03,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-07-21 17:32:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:32:03,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:03,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:03,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:32:03,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-21 17:32:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:03,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219266138] [2022-07-21 17:32:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:03,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:03,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219266138] [2022-07-21 17:32:03,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219266138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:03,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:03,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:32:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182321991] [2022-07-21 17:32:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:03,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:32:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:32:03,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:32:03,385 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:04,003 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-07-21 17:32:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:32:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:32:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:04,004 INFO L225 Difference]: With dead ends: 232 [2022-07-21 17:32:04,004 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 17:32:04,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:32:04,005 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:04,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 388 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:32:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 17:32:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2022-07-21 17:32:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-07-21 17:32:04,009 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2022-07-21 17:32:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:04,010 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-07-21 17:32:04,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-07-21 17:32:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:32:04,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:04,011 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:04,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:32:04,011 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2022-07-21 17:32:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169832445] [2022-07-21 17:32:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:32:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:04,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169832445] [2022-07-21 17:32:04,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169832445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:32:04,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:32:04,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:32:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21864628] [2022-07-21 17:32:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:32:04,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:32:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:04,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:32:04,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:32:04,062 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:04,171 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-07-21 17:32:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:32:04,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-21 17:32:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:04,173 INFO L225 Difference]: With dead ends: 253 [2022-07-21 17:32:04,173 INFO L226 Difference]: Without dead ends: 253 [2022-07-21 17:32:04,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:32:04,174 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 295 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:04,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:32:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-21 17:32:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2022-07-21 17:32:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2022-07-21 17:32:04,178 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2022-07-21 17:32:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:04,179 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2022-07-21 17:32:04,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2022-07-21 17:32:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 17:32:04,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:04,180 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:32:04,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:32:04,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2022-07-21 17:32:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:04,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776370663] [2022-07-21 17:32:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:04,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776370663] [2022-07-21 17:32:04,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776370663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:32:04,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18890133] [2022-07-21 17:32:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:32:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:32:04,383 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) [2022-07-21 17:32:04,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:32:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:04,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 17:32:04,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:32:04,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:04,643 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:32:04,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:04,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:04,745 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:04,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 17:32:04,825 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:04,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-21 17:32:04,884 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:04,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:05,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:32:05,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:05,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 16 [2022-07-21 17:32:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:05,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:32:05,284 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-21 17:32:05,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-21 17:32:05,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-07-21 17:32:05,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-07-21 17:32:05,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-07-21 17:32:05,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-07-21 17:32:05,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2022-07-21 17:32:05,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:05,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2022-07-21 17:32:05,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:05,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 137 [2022-07-21 17:32:05,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-07-21 17:32:05,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:05,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 102 [2022-07-21 17:32:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:06,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18890133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:32:06,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:32:06,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-21 17:32:06,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185349006] [2022-07-21 17:32:06,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:32:06,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 17:32:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:32:06,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 17:32:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=782, Unknown=6, NotChecked=300, Total=1190 [2022-07-21 17:32:06,169 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:07,793 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2022-07-21 17:32:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 17:32:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-21 17:32:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:07,796 INFO L225 Difference]: With dead ends: 505 [2022-07-21 17:32:07,796 INFO L226 Difference]: Without dead ends: 505 [2022-07-21 17:32:07,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1730, Unknown=6, NotChecked=460, Total=2550 [2022-07-21 17:32:07,797 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 773 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1883 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:07,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1654 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1611 Invalid, 0 Unknown, 1883 Unchecked, 0.9s Time] [2022-07-21 17:32:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-21 17:32:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 239. [2022-07-21 17:32:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2022-07-21 17:32:07,802 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2022-07-21 17:32:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:07,802 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2022-07-21 17:32:07,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2022-07-21 17:32:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 17:32:07,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:07,806 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:32:07,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:32:08,007 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,SelfDestructingSolverStorable10 [2022-07-21 17:32:08,007 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:32:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2022-07-21 17:32:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:32:08,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361026480] [2022-07-21 17:32:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:32:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:08,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:32:08,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361026480] [2022-07-21 17:32:08,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361026480] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:32:08,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615534428] [2022-07-21 17:32:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:08,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:32:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:32:08,216 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) [2022-07-21 17:32:08,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:32:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:08,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 17:32:08,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:32:08,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:08,388 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:32:08,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:08,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:32:08,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:32:08,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:08,535 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:08,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-21 17:32:08,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:08,636 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:08,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-21 17:32:08,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:32:08,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:08,709 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:08,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-21 17:32:08,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:32:08,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:32:08,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:32:08,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:32:08,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:08,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 16 [2022-07-21 17:32:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:08,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:32:09,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_75| 0) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (and (<= 0 (+ .cse0 8)) (<= (+ .cse0 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-21 17:32:09,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 8))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_75| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-21 17:32:10,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:10,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-21 17:32:10,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:10,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-21 17:32:10,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:10,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 632 treesize of output 567 [2022-07-21 17:32:10,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:10,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1872 treesize of output 1783 [2022-07-21 17:32:10,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1768 treesize of output 1688 [2022-07-21 17:32:10,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1688 treesize of output 1656 [2022-07-21 17:32:10,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1656 treesize of output 1576 [2022-07-21 17:32:10,436 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:10,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1576 treesize of output 1436 [2022-07-21 17:33:33,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:33,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-21 17:33:33,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:33,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-21 17:33:33,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:33:33,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-07-21 17:33:33,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:33:33,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-21 17:33:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:33:33,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615534428] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:33:33,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:33:33,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 36 [2022-07-21 17:33:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026294869] [2022-07-21 17:33:33,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:33:33,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 17:33:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:33,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 17:33:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1059, Unknown=12, NotChecked=134, Total=1332 [2022-07-21 17:33:33,726 INFO L87 Difference]: Start difference. First operand 239 states and 284 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:35,500 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2022-07-21 17:33:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 17:33:35,502 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-21 17:33:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:35,504 INFO L225 Difference]: With dead ends: 418 [2022-07-21 17:33:35,504 INFO L226 Difference]: Without dead ends: 418 [2022-07-21 17:33:35,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=542, Invalid=2760, Unknown=12, NotChecked=226, Total=3540 [2022-07-21 17:33:35,506 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1325 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1342 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:35,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1261 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1270 Invalid, 0 Unknown, 1342 Unchecked, 0.7s Time] [2022-07-21 17:33:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-21 17:33:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2022-07-21 17:33:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 238 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2022-07-21 17:33:35,511 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2022-07-21 17:33:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:35,512 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2022-07-21 17:33:35,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-07-21 17:33:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:33:35,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:35,513 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:33:35,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:33:35,727 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,SelfDestructingSolverStorable11 [2022-07-21 17:33:35,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2022-07-21 17:33:35,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:35,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183458396] [2022-07-21 17:33:35,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:35,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:33:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183458396] [2022-07-21 17:33:35,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183458396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:33:35,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:33:35,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:33:35,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200531866] [2022-07-21 17:33:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:33:35,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:33:35,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:33:35,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:33:35,763 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:35,770 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2022-07-21 17:33:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:33:35,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-21 17:33:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:35,771 INFO L225 Difference]: With dead ends: 241 [2022-07-21 17:33:35,771 INFO L226 Difference]: Without dead ends: 241 [2022-07-21 17:33:35,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:33:35,772 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:35,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:33:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-21 17:33:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-21 17:33:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-07-21 17:33:35,776 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2022-07-21 17:33:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:35,777 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-07-21 17:33:35,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-07-21 17:33:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:33:35,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:35,778 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:33:35,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:33:35,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:35,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2022-07-21 17:33:35,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:35,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611445660] [2022-07-21 17:33:35,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:35,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:33:35,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:35,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611445660] [2022-07-21 17:33:35,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611445660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:33:35,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:33:35,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:33:35,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735950028] [2022-07-21 17:33:35,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:33:35,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:33:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:33:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:33:35,849 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:36,062 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2022-07-21 17:33:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:33:36,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-21 17:33:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:36,063 INFO L225 Difference]: With dead ends: 258 [2022-07-21 17:33:36,064 INFO L226 Difference]: Without dead ends: 258 [2022-07-21 17:33:36,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:33:36,064 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:36,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 619 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:33:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-21 17:33:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2022-07-21 17:33:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 203 states have (on average 1.4482758620689655) internal successors, (294), 248 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2022-07-21 17:33:36,068 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2022-07-21 17:33:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:36,068 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2022-07-21 17:33:36,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2022-07-21 17:33:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:33:36,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:36,069 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:33:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:33:36,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:36,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2022-07-21 17:33:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:36,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146502345] [2022-07-21 17:33:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:33:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:36,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146502345] [2022-07-21 17:33:36,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146502345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:33:36,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:33:36,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:33:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560390034] [2022-07-21 17:33:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:33:36,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:33:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:33:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:33:36,105 INFO L87 Difference]: Start difference. First operand 249 states and 294 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:36,164 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2022-07-21 17:33:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:33:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-21 17:33:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:36,166 INFO L225 Difference]: With dead ends: 246 [2022-07-21 17:33:36,166 INFO L226 Difference]: Without dead ends: 246 [2022-07-21 17:33:36,166 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 [2022-07-21 17:33:36,167 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:36,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:33:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-21 17:33:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2022-07-21 17:33:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 244 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-07-21 17:33:36,171 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2022-07-21 17:33:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:36,171 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-07-21 17:33:36,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-07-21 17:33:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:33:36,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:36,172 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:33:36,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:33:36,173 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2022-07-21 17:33:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:36,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500241039] [2022-07-21 17:33:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:33:36,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:36,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500241039] [2022-07-21 17:33:36,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500241039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:33:36,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:33:36,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:33:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003970914] [2022-07-21 17:33:36,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:33:36,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:33:36,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:33:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:33:36,209 INFO L87 Difference]: Start difference. First operand 245 states and 286 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:36,270 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2022-07-21 17:33:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:33:36,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-21 17:33:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:36,272 INFO L225 Difference]: With dead ends: 241 [2022-07-21 17:33:36,272 INFO L226 Difference]: Without dead ends: 241 [2022-07-21 17:33:36,272 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 [2022-07-21 17:33:36,273 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:36,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:33:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-21 17:33:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-21 17:33:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 240 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2022-07-21 17:33:36,277 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2022-07-21 17:33:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:36,277 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2022-07-21 17:33:36,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2022-07-21 17:33:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:33:36,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:36,278 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:33:36,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:33:36,279 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2022-07-21 17:33:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:36,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771800365] [2022-07-21 17:33:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:33:36,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:36,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771800365] [2022-07-21 17:33:36,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771800365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:33:36,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:33:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:33:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374110659] [2022-07-21 17:33:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:33:36,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:33:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:33:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:33:36,336 INFO L87 Difference]: Start difference. First operand 241 states and 278 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:36,538 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2022-07-21 17:33:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:33:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-21 17:33:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:36,539 INFO L225 Difference]: With dead ends: 261 [2022-07-21 17:33:36,539 INFO L226 Difference]: Without dead ends: 261 [2022-07-21 17:33:36,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:33:36,540 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:36,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 335 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:33:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-21 17:33:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-07-21 17:33:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 239 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2022-07-21 17:33:36,545 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2022-07-21 17:33:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:36,545 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2022-07-21 17:33:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2022-07-21 17:33:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:33:36,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:36,546 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:33:36,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 17:33:36,547 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2022-07-21 17:33:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218946060] [2022-07-21 17:33:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:33:36,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:36,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218946060] [2022-07-21 17:33:36,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218946060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:33:36,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102509021] [2022-07-21 17:33:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:36,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:33:36,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:33:36,772 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) [2022-07-21 17:33:36,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 17:33:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:36,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-21 17:33:36,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:33:36,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:36,939 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:33:36,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:36,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:36,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:33:37,064 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:33:37,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-21 17:33:37,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:37,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:37,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:37,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:37,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:37,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:33:37,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:37,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 17 [2022-07-21 17:33:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:33:37,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:33:37,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:37,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 36 [2022-07-21 17:33:37,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-21 17:33:37,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-21 17:33:37,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-21 17:33:37,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-21 17:33:37,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (<= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-21 17:33:37,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:37,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-21 17:33:37,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:37,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-21 17:33:37,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-07-21 17:33:37,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:37,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 166 treesize of output 161 [2022-07-21 17:33:37,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 118 [2022-07-21 17:33:37,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 132 [2022-07-21 17:33:37,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 98 [2022-07-21 17:33:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:33:38,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102509021] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:33:38,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:33:38,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2022-07-21 17:33:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956252803] [2022-07-21 17:33:38,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:33:38,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 17:33:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 17:33:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1396, Unknown=5, NotChecked=400, Total=1980 [2022-07-21 17:33:38,019 INFO L87 Difference]: Start difference. First operand 240 states and 277 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:39,750 INFO L93 Difference]: Finished difference Result 346 states and 392 transitions. [2022-07-21 17:33:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-21 17:33:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-21 17:33:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:39,751 INFO L225 Difference]: With dead ends: 346 [2022-07-21 17:33:39,751 INFO L226 Difference]: Without dead ends: 346 [2022-07-21 17:33:39,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=653, Invalid=3784, Unknown=5, NotChecked=670, Total=5112 [2022-07-21 17:33:39,753 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 434 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1312 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:39,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1863 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1492 Invalid, 0 Unknown, 1312 Unchecked, 0.8s Time] [2022-07-21 17:33:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-21 17:33:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227. [2022-07-21 17:33:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.3248730964467006) internal successors, (261), 226 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2022-07-21 17:33:39,758 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 36 [2022-07-21 17:33:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:39,759 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2022-07-21 17:33:39,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2022-07-21 17:33:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 17:33:39,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:39,760 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:33:39,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:33:39,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 17:33:39,975 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2022-07-21 17:33:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:39,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269173915] [2022-07-21 17:33:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:33:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269173915] [2022-07-21 17:33:40,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269173915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:33:40,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:33:40,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:33:40,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915823707] [2022-07-21 17:33:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:33:40,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:33:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:33:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:33:40,025 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:40,204 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-07-21 17:33:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:33:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-21 17:33:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:40,205 INFO L225 Difference]: With dead ends: 247 [2022-07-21 17:33:40,205 INFO L226 Difference]: Without dead ends: 247 [2022-07-21 17:33:40,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:33:40,206 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:40,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 334 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:33:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-21 17:33:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2022-07-21 17:33:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 232 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2022-07-21 17:33:40,223 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 40 [2022-07-21 17:33:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:40,224 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2022-07-21 17:33:40,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2022-07-21 17:33:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 17:33:40,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:40,225 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:33:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 17:33:40,225 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2022-07-21 17:33:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:40,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849445808] [2022-07-21 17:33:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:33:40,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849445808] [2022-07-21 17:33:40,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849445808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:33:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540430243] [2022-07-21 17:33:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:40,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:33:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:33:40,431 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) [2022-07-21 17:33:40,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 17:33:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:40,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 17:33:40,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:33:40,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:40,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-21 17:33:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:33:40,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:33:40,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540430243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:33:40,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:33:40,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-07-21 17:33:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064461882] [2022-07-21 17:33:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:33:40,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:33:40,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:33:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:33:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-07-21 17:33:40,644 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:33:40,869 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2022-07-21 17:33:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:33:40,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-21 17:33:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:33:40,871 INFO L225 Difference]: With dead ends: 242 [2022-07-21 17:33:40,871 INFO L226 Difference]: Without dead ends: 242 [2022-07-21 17:33:40,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:33:40,871 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:33:40,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:33:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-21 17:33:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 231. [2022-07-21 17:33:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 230 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2022-07-21 17:33:40,876 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 40 [2022-07-21 17:33:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:33:40,876 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2022-07-21 17:33:40,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:33:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2022-07-21 17:33:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 17:33:40,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:33:40,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:33:40,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:33:41,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:33:41,087 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-21 17:33:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:33:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2022-07-21 17:33:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:33:41,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574421786] [2022-07-21 17:33:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:33:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:33:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:33:41,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574421786] [2022-07-21 17:33:41,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574421786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:33:41,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567012103] [2022-07-21 17:33:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:33:41,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:33:41,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:33:41,332 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) [2022-07-21 17:33:41,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 17:33:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:33:41,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 17:33:41,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:33:41,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:41,494 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:33:41,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:41,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:33:41,568 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:33:41,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 17:33:41,639 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 17:33:41,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-07-21 17:33:41,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 17:33:41,718 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-21 17:33:41,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 70 [2022-07-21 17:33:41,730 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-21 17:33:41,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-21 17:33:41,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:33:42,014 INFO L356 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-07-21 17:33:42,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 45 [2022-07-21 17:33:42,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:33:42,024 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:33:42,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2022-07-21 17:33:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:33:42,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:33:56,570 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:33:56,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 810 treesize of output 629 [2022-07-21 17:34:14,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:34:14,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6311 treesize of output 4269